Base | Representation |
---|---|
bin | 11111000110001010000… |
… | …000100100010000000001 |
3 | 21120021202012222022212101 |
4 | 133012022000210100001 |
5 | 240002400010303101 |
6 | 4313403530230401 |
7 | 310246503403222 |
oct | 37061200442001 |
9 | 7507665868771 |
10 | 2136914150401 |
11 | 7542953684a8 |
12 | 2a6194285401 |
13 | 126682a14054 |
14 | 755da329249 |
15 | 3a8bcd4d401 |
hex | 1f18a024401 |
2136914150401 has 8 divisors (see below), whose sum is σ = 2230101998784. Its totient is φ = 2043749513520.
The previous prime is 2136914150383. The next prime is 2136914150419. The reversal of 2136914150401 is 1040514196312.
It is an interprime number because it is at equal distance from previous prime (2136914150383) and next prime (2136914150419).
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 2136914150401 - 229 = 2136377279489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2136914151401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5614606 + ... + 5983111.
It is an arithmetic number, because the mean of its divisors is an integer number (278762749848).
Almost surely, 22136914150401 is an apocalyptic number.
It is an amenable number.
2136914150401 is a deficient number, since it is larger than the sum of its proper divisors (93187848383).
2136914150401 is a wasteful number, since it uses less digits than its factorization.
2136914150401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11605751.
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 2136914150401 in words is "two trillion, one hundred thirty-six billion, nine hundred fourteen million, one hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •