Base | Representation |
---|---|
bin | 11111000001100101001… |
… | …110101101000101001101 |
3 | 21112211001220010221210002 |
4 | 133001211032231011031 |
5 | 234412320021213201 |
6 | 4311232300454045 |
7 | 310014000054566 |
oct | 37014516550515 |
9 | 7484056127702 |
10 | 2132002132301 |
11 | 7521a4693608 |
12 | 2a524324a325 |
13 | 12607c17b972 |
14 | 75291c0b16d |
15 | 3a6d19c576b |
hex | 1f0653ad14d |
2132002132301 has 8 divisors (see below), whose sum is σ = 2132769068160. Its totient is φ = 2131235314992.
The previous prime is 2132002132283. The next prime is 2132002132319. The reversal of 2132002132301 is 1032312002312.
It is an interprime number because it is at equal distance from previous prime (2132002132283) and next prime (2132002132319).
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 2132002132301 - 210 = 2132002131277 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 (2132002132321) 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, 50310560 + ... + 50352918.
It is an arithmetic number, because the mean of its divisors is an integer number (266596133520).
Almost surely, 22132002132301 is an apocalyptic number.
It is an amenable number.
2132002132301 is a deficient number, since it is larger than the sum of its proper divisors (766935859).
2132002132301 is a wasteful number, since it uses less digits than its factorization.
2132002132301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59275.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2132002132301 its reverse (1032312002312), we get a palindrome (3164314134613).
The spelling of 2132002132301 in words is "two trillion, one hundred thirty-two billion, two million, one hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •