Base | Representation |
---|---|
bin | 11110110110100100110… |
… | …000010101001111111101 |
3 | 21111200120012101100101211 |
4 | 132312210300111033331 |
5 | 234214113322312201 |
6 | 4301555412004421 |
7 | 306115053144136 |
oct | 36664460251775 |
9 | 7450505340354 |
10 | 2120183010301 |
11 | 74818a044294 |
12 | 2a2aa5000711 |
13 | 124c17637855 |
14 | 74890234c8d |
15 | 3a23e083651 |
hex | 1eda4c153fd |
2120183010301 has 8 divisors (see below), whose sum is σ = 2122251527360. Its totient is φ = 2118115329408.
The previous prime is 2120183010289. The next prime is 2120183010331. The reversal of 2120183010301 is 1030103810212.
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 2120183010301 - 27 = 2120183010173 is a prime.
It is a super-2 number, since 2×21201830103012 (a number of 25 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 (2120183010331) 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, 4925965 + ... + 5339053.
It is an arithmetic number, because the mean of its divisors is an integer number (265281440920).
Almost surely, 22120183010301 is an apocalyptic number.
It is an amenable number.
2120183010301 is a deficient number, since it is larger than the sum of its proper divisors (2068517059).
2120183010301 is a wasteful number, since it uses less digits than its factorization.
2120183010301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 418083.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 2120183010301 its reverse (1030103810212), we get a palindrome (3150286820513).
The spelling of 2120183010301 in words is "two trillion, one hundred twenty billion, one hundred eighty-three million, ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •