Base | Representation |
---|---|
bin | 100010110111101111111110… |
… | …001111001110111010110111 |
3 | 202010000112000000211210001121 |
4 | 202313233332033032322313 |
5 | 130100211312114110112 |
6 | 1302102430421404411 |
7 | 44206142211303244 |
oct | 4267577617167267 |
9 | 663015000753047 |
10 | 153364662644407 |
11 | 44959651944025 |
12 | 1524b123269707 |
13 | 67762c1936686 |
14 | 29c2c642705cb |
15 | 12ae57809e407 |
hex | 8b7bfe3ceeb7 |
153364662644407 has 4 divisors (see below), whose sum is σ = 153510585255016. Its totient is φ = 153218740033800.
The previous prime is 153364662644363. The next prime is 153364662644437. The reversal of 153364662644407 is 704446266463351.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-153364662644407 is a prime.
It is a super-2 number, since 2×1533646626444072 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153364662644437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72961303728 + ... + 72961305829.
It is an arithmetic number, because the mean of its divisors is an integer number (38377646313754).
Almost surely, 2153364662644407 is an apocalyptic number.
153364662644407 is a deficient number, since it is larger than the sum of its proper divisors (145922610609).
153364662644407 is a wasteful number, since it uses less digits than its factorization.
153364662644407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145922610608.
The product of its (nonzero) digits is 209018880, while the sum is 61.
The spelling of 153364662644407 in words is "one hundred fifty-three trillion, three hundred sixty-four billion, six hundred sixty-two million, six hundred forty-four thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •