Base | Representation |
---|---|
bin | 10111011111001111110010… |
… | …110111010100001111111111 |
3 | 111112202121101012111200200202 |
4 | 113133033302313110033333 |
5 | 102020001134223220411 |
6 | 1003412234152114115 |
7 | 30521230053533006 |
oct | 2737176267241777 |
9 | 445677335450622 |
10 | 103302333023231 |
11 | 2aa083009a6021 |
12 | b70482639593b |
13 | 45844a2c3c964 |
14 | 1b71c06a33c3d |
15 | be21e641883b |
hex | 5df3f2dd43ff |
103302333023231 has 2 divisors, whose sum is σ = 103302333023232. Its totient is φ = 103302333023230.
The previous prime is 103302333023189. The next prime is 103302333023243. The reversal of 103302333023231 is 132320333203301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103302333023231 - 242 = 98904286512127 is a prime.
It is a super-2 number, since 2×1033023330232312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103302333023194 and 103302333023203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103302333023731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51651166511615 + 51651166511616.
It is an arithmetic number, because the mean of its divisors is an integer number (51651166511616).
Almost surely, 2103302333023231 is an apocalyptic number.
103302333023231 is a deficient number, since it is larger than the sum of its proper divisors (1).
103302333023231 is an equidigital number, since it uses as much as digits as its factorization.
103302333023231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 29.
Adding to 103302333023231 its reverse (132320333203301), we get a palindrome (235622666226532).
The spelling of 103302333023231 in words is "one hundred three trillion, three hundred two billion, three hundred thirty-three million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •