Base | Representation |
---|---|
bin | 110100010111010110100000… |
… | …011000010111100000010111 |
3 | 1010012102202122020220002020020 |
4 | 310113112200120113200113 |
5 | 220141241303310333421 |
6 | 2133451444234040223 |
7 | 66336565210356000 |
oct | 6427264030274027 |
9 | 1105382566802206 |
10 | 230303132121111 |
11 | 67422012101645 |
12 | 219b6358b79073 |
13 | 9b676523c031a |
14 | 40c2a340ac1a7 |
15 | 1b95aa64b7dc6 |
hex | d175a0617817 |
230303132121111 has 32 divisors (see below), whose sum is σ = 358102213056000. Its totient is φ = 131601016270080.
The previous prime is 230303132121079. The next prime is 230303132121131. The reversal of 230303132121111 is 111121231303032.
It is not a de Polignac number, because 230303132121111 - 25 = 230303132121079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230303132121131) 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, 206044231 + ... + 207158951.
It is an arithmetic number, because the mean of its divisors is an integer number (11190694158000).
Almost surely, 2230303132121111 is an apocalyptic number.
230303132121111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
230303132121111 is a deficient number, since it is larger than the sum of its proper divisors (127799080934889).
230303132121111 is a wasteful number, since it uses less digits than its factorization.
230303132121111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1315524 (or 1315510 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 230303132121111 its reverse (111121231303032), we get a palindrome (341424363424143).
The spelling of 230303132121111 in words is "two hundred thirty trillion, three hundred three billion, one hundred thirty-two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •