Base | Representation |
---|---|
bin | 100001011110001001111… |
… | …101001110000011011101 |
3 | 22010220000110101122210222 |
4 | 201132021331032003131 |
5 | 300141122214432201 |
6 | 4520354513411125 |
7 | 325115111446034 |
oct | 41361175160335 |
9 | 8126013348728 |
10 | 2300122030301 |
11 | 807526a16277 |
12 | 311942269aa5 |
13 | 138b9274b054 |
14 | 7d47dcb971b |
15 | 3ec7124391b |
hex | 21789f4e0dd |
2300122030301 has 32 divisors (see below), whose sum is σ = 2451197548800. Its totient is φ = 2154556938240.
The previous prime is 2300122030279. The next prime is 2300122030307. The reversal of 2300122030301 is 1030302210032.
It is a cyclic number.
It is not a de Polignac number, because 2300122030301 - 218 = 2300121768157 is a prime.
It is a super-2 number, since 2×23001220303012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2300122030301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2300122030307) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 200196365 + ... + 200207853.
It is an arithmetic number, because the mean of its divisors is an integer number (76599923400).
Almost surely, 22300122030301 is an apocalyptic number.
It is an amenable number.
2300122030301 is a deficient number, since it is larger than the sum of its proper divisors (151075518499).
2300122030301 is a wasteful number, since it uses less digits than its factorization.
2300122030301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12629.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 2300122030301 its reverse (1030302210032), we get a palindrome (3330424240333).
The spelling of 2300122030301 in words is "two trillion, three hundred billion, one hundred twenty-two million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •