Base | Representation |
---|---|
bin | 1001010101111000… |
… | …00101011100101011 |
3 | 110221112021202100002 |
4 | 10222330011130223 |
5 | 40232413030243 |
6 | 2145400333215 |
7 | 235166603450 |
oct | 45274053453 |
9 | 13845252302 |
10 | 5015361323 |
11 | 214404a215 |
12 | b7b77420b |
13 | 61c0a982b |
14 | 35813d827 |
15 | 1e548ceb8 |
hex | 12af0572b |
5015361323 has 8 divisors (see below), whose sum is σ = 5742805248. Its totient is φ = 4290658344.
The previous prime is 5015361311. The next prime is 5015361371. The reversal of 5015361323 is 3231635105.
5015361323 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5015361323 - 26 = 5015361259 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5015361223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 681311 + ... + 688632.
It is an arithmetic number, because the mean of its divisors is an integer number (717850656).
Almost surely, 25015361323 is an apocalyptic number.
5015361323 is a deficient number, since it is larger than the sum of its proper divisors (727443925).
5015361323 is a wasteful number, since it uses less digits than its factorization.
5015361323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1370473.
The product of its (nonzero) digits is 8100, while the sum is 29.
The square root of 5015361323 is about 70819.2157750988. The cubic root of 5015361323 is about 1711.7253225720.
Adding to 5015361323 its reverse (3231635105), we get a palindrome (8246996428).
The spelling of 5015361323 in words is "five billion, fifteen million, three hundred sixty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •