Base | Representation |
---|---|
bin | 1101101111001011000… |
… | …1001011101011000001 |
3 | 211120011022220210122011 |
4 | 3123302301023223001 |
5 | 12331312302304441 |
6 | 300230101012521 |
7 | 23023221133012 |
oct | 3336261135301 |
9 | 746138823564 |
10 | 236001213121 |
11 | 910a65944a3 |
12 | 398a43b4141 |
13 | 19340ab624b |
14 | b5cb573009 |
15 | 6213d75581 |
hex | 36f2c4bac1 |
236001213121 has 2 divisors, whose sum is σ = 236001213122. Its totient is φ = 236001213120.
The previous prime is 236001213113. The next prime is 236001213169. The reversal of 236001213121 is 121312100632.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 207174266896 + 28826946225 = 455164^2 + 169785^2 .
It is a cyclic number.
It is not a de Polignac number, because 236001213121 - 23 = 236001213113 is a prime.
It is a super-3 number, since 3×2360012131213 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 236001213092 and 236001213101.
It is not a weakly prime, because it can be changed into another prime (236001213181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 118000606560 + 118000606561.
It is an arithmetic number, because the mean of its divisors is an integer number (118000606561).
Almost surely, 2236001213121 is an apocalyptic number.
It is an amenable number.
236001213121 is a deficient number, since it is larger than the sum of its proper divisors (1).
236001213121 is an equidigital number, since it uses as much as digits as its factorization.
236001213121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 236001213121 its reverse (121312100632), we get a palindrome (357313313753).
The spelling of 236001213121 in words is "two hundred thirty-six billion, one million, two hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •