Base | Representation |
---|---|
bin | 110100010111011110110011… |
… | …010110000010101000010011 |
3 | 1010012110121122002001001000212 |
4 | 310113132303112002220103 |
5 | 220141413024243304021 |
6 | 2133455520213234335 |
7 | 66340332026036261 |
oct | 6427366326025023 |
9 | 1105417562031025 |
10 | 230312040213011 |
11 | 67425873528969 |
12 | 219b80243329ab |
13 | 9b68441b01013 |
14 | 40c323b1db431 |
15 | 1b95e2858c85b |
hex | d177b3582a13 |
230312040213011 has 2 divisors, whose sum is σ = 230312040213012. Its totient is φ = 230312040213010.
The previous prime is 230312040212993. The next prime is 230312040213037. The reversal of 230312040213011 is 110312040213032.
230312040213011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 230312040213011 - 238 = 230037162306067 is a prime.
It is a super-2 number, since 2×2303120402130112 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (230312040213041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115156020106505 + 115156020106506.
It is an arithmetic number, because the mean of its divisors is an integer number (115156020106506).
Almost surely, 2230312040213011 is an apocalyptic number.
230312040213011 is a deficient number, since it is larger than the sum of its proper divisors (1).
230312040213011 is an equidigital number, since it uses as much as digits as its factorization.
230312040213011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 230312040213011 its reverse (110312040213032), we get a palindrome (340624080426043).
The spelling of 230312040213011 in words is "two hundred thirty trillion, three hundred twelve billion, forty million, two hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •