Base | Representation |
---|---|
bin | 1101100000011000010… |
… | …1110011110101011001 |
3 | 211011220121011121220212 |
4 | 3120012011303311121 |
5 | 12300144241422223 |
6 | 254332053100505 |
7 | 22522634013416 |
oct | 3300605636531 |
9 | 734817147825 |
10 | 232030420313 |
11 | 8a44913a04a |
12 | 38b76627735 |
13 | 18b5a24c9c3 |
14 | b33206310d |
15 | 608046e278 |
hex | 3606173d59 |
232030420313 has 2 divisors, whose sum is σ = 232030420314. Its totient is φ = 232030420312.
The previous prime is 232030420231. The next prime is 232030420343. The reversal of 232030420313 is 313024030232.
232030420313 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 can be written as a sum of positive squares in only one way, i.e., 232028146249 + 2274064 = 481693^2 + 1508^2 .
It is a cyclic number.
It is not a de Polignac number, because 232030420313 - 214 = 232030403929 is a prime.
It is not a weakly prime, because it can be changed into another prime (232030420343) 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 as a sum of consecutive naturals, namely, 116015210156 + 116015210157.
It is an arithmetic number, because the mean of its divisors is an integer number (116015210157).
Almost surely, 2232030420313 is an apocalyptic number.
It is an amenable number.
232030420313 is a deficient number, since it is larger than the sum of its proper divisors (1).
232030420313 is an equidigital number, since it uses as much as digits as its factorization.
232030420313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 232030420313 its reverse (313024030232), we get a palindrome (545054450545).
The spelling of 232030420313 in words is "two hundred thirty-two billion, thirty million, four hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •