Base | Representation |
---|---|
bin | 110100010100011010100011… |
… | …011101000001011110011011 |
3 | 1010011201110201122011210102011 |
4 | 310110122203131001132123 |
5 | 220124440000433212311 |
6 | 2133215030500250351 |
7 | 66316162135416163 |
oct | 6424324335013633 |
9 | 1104643648153364 |
10 | 230101320210331 |
11 | 67354470591019 |
12 | 219832166a09b7 |
13 | 9b515cc8a08bb |
14 | 40b6d6b4d35a3 |
15 | 1b906e3e36321 |
hex | d146a374179b |
230101320210331 has 2 divisors, whose sum is σ = 230101320210332. Its totient is φ = 230101320210330.
The previous prime is 230101320210269. The next prime is 230101320210367. The reversal of 230101320210331 is 133012023101032.
230101320210331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 230101320210331 - 233 = 230092730275739 is a prime.
It is a super-2 number, since 2×2301013202103312 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (230101320211331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115050660105165 + 115050660105166.
It is an arithmetic number, because the mean of its divisors is an integer number (115050660105166).
Almost surely, 2230101320210331 is an apocalyptic number.
230101320210331 is a deficient number, since it is larger than the sum of its proper divisors (1).
230101320210331 is an equidigital number, since it uses as much as digits as its factorization.
230101320210331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 230101320210331 its reverse (133012023101032), we get a palindrome (363113343311363).
The spelling of 230101320210331 in words is "two hundred thirty trillion, one hundred one billion, three hundred twenty million, two hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •