Base | Representation |
---|---|
bin | 10010110001000111… |
… | …101011111011010001 |
3 | 1221000101111210102211 |
4 | 102301013223323101 |
5 | 312232232420340 |
6 | 13131335312121 |
7 | 1312241340004 |
oct | 226107537321 |
9 | 57011453384 |
10 | 20151451345 |
11 | 8600a72723 |
12 | 3aa481b641 |
13 | 1b91b9430c |
14 | d9246b53b |
15 | 7ce1d55ea |
hex | 4b11ebed1 |
20151451345 has 8 divisors (see below), whose sum is σ = 24307036776. Its totient is φ = 16037630976.
The previous prime is 20151451343. The next prime is 20151451349. The reversal of 20151451345 is 54315415102.
It can be written as a sum of positive squares in 4 ways, for example, as 1462374081 + 18689077264 = 38241^2 + 136708^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20151451345 - 21 = 20151451343 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20151451343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10440202 + ... + 10442131.
It is an arithmetic number, because the mean of its divisors is an integer number (3038379597).
Almost surely, 220151451345 is an apocalyptic number.
It is an amenable number.
20151451345 is a deficient number, since it is larger than the sum of its proper divisors (4155585431).
20151451345 is a wasteful number, since it uses less digits than its factorization.
20151451345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20882531.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 20151451345 its reverse (54315415102), we get a palindrome (74466866447).
The spelling of 20151451345 in words is "twenty billion, one hundred fifty-one million, four hundred fifty-one thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •