Base | Representation |
---|---|
bin | 100010101100101011110010… |
… | …010011100100101110010111 |
3 | 202000022211020210101220012221 |
4 | 202230223302103210232113 |
5 | 130000232002312304221 |
6 | 1300321232013123211 |
7 | 44100202441116601 |
oct | 4254536223445627 |
9 | 660284223356187 |
10 | 152604253244311 |
11 | 44696111631a90 |
12 | 15147887789507 |
13 | 671c699c8949b |
14 | 2998129d86171 |
15 | 12998c0875541 |
hex | 8acaf24e4b97 |
152604253244311 has 8 divisors (see below), whose sum is σ = 166477732876800. Its totient is φ = 138730834562040.
The previous prime is 152604253244291. The next prime is 152604253244341. The reversal of 152604253244311 is 113442352406251.
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 not a de Polignac number, because 152604253244311 - 25 = 152604253244279 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152604253244341) 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, 9921801 + ... + 20091058.
It is an arithmetic number, because the mean of its divisors is an integer number (20809716609600).
Almost surely, 2152604253244311 is an apocalyptic number.
152604253244311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
152604253244311 is a deficient number, since it is larger than the sum of its proper divisors (13873479632489).
152604253244311 is a wasteful number, since it uses less digits than its factorization.
152604253244311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30475109.
The product of its (nonzero) digits is 691200, while the sum is 43.
The spelling of 152604253244311 in words is "one hundred fifty-two trillion, six hundred four billion, two hundred fifty-three million, two hundred forty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •