Base | Representation |
---|---|
bin | 100010101010000000100001… |
… | …001000010110000111111111 |
3 | 201222200020120121212011022002 |
4 | 202222000201020112013333 |
5 | 124434223341420030401 |
6 | 1300100540004412515 |
7 | 44051002330623026 |
oct | 4252004110260777 |
9 | 658606517764262 |
10 | 152420355236351 |
11 | 44625122a38824 |
12 | 151181046a713b |
13 | 67082408b3967 |
14 | 298d2825c58bd |
15 | 1294c0ad41a6b |
hex | 8aa0212161ff |
152420355236351 has 8 divisors (see below), whose sum is σ = 156153432094800. Its totient is φ = 148688016816960.
The previous prime is 152420355236327. The next prime is 152420355236353. The reversal of 152420355236351 is 153632553024251.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152420355236351 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152420355236296 and 152420355236305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152420355236353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184191881 + ... + 185017538.
It is an arithmetic number, because the mean of its divisors is an integer number (19519179011850).
Almost surely, 2152420355236351 is an apocalyptic number.
152420355236351 is a deficient number, since it is larger than the sum of its proper divisors (3733076858449).
152420355236351 is a wasteful number, since it uses less digits than its factorization.
152420355236351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 369219529.
The product of its (nonzero) digits is 3240000, while the sum is 47.
The spelling of 152420355236351 in words is "one hundred fifty-two trillion, four hundred twenty billion, three hundred fifty-five million, two hundred thirty-six thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •