Base | Representation |
---|---|
bin | 110100010100101110000110… |
… | …000100001101010000100011 |
3 | 1010011210110212220010020221010 |
4 | 310110232012010031100203 |
5 | 220130310433303032321 |
6 | 2133232420501032003 |
7 | 66320534111620113 |
oct | 6424560604152043 |
9 | 1104713786106833 |
10 | 230122302002211 |
11 | 67362358227893 |
12 | 219872b13b5603 |
13 | 9b535947aba78 |
14 | 40b7d9bd47043 |
15 | 1b91020e88676 |
hex | d14b8610d423 |
230122302002211 has 8 divisors (see below), whose sum is σ = 320170159307520. Its totient is φ = 146744656349192.
The previous prime is 230122302002209. The next prime is 230122302002237. The reversal of 230122302002211 is 112200203221032.
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 230122302002211 - 21 = 230122302002209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (230122302002251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1667552912991 + ... + 1667552913128.
It is an arithmetic number, because the mean of its divisors is an integer number (40021269913440).
Almost surely, 2230122302002211 is an apocalyptic number.
230122302002211 is a deficient number, since it is larger than the sum of its proper divisors (90047857305309).
230122302002211 is a wasteful number, since it uses less digits than its factorization.
230122302002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3335105826145.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 230122302002211 its reverse (112200203221032), we get a palindrome (342322505223243).
The spelling of 230122302002211 in words is "two hundred thirty trillion, one hundred twenty-two billion, three hundred two million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •