Base | Representation |
---|---|
bin | 10111001100010101111111… |
… | …001100001110001111111111 |
3 | 111101011102101012200202100021 |
4 | 113030111333030032033333 |
5 | 101332210240412120411 |
6 | 1000535401424113011 |
7 | 30325332111111646 |
oct | 2714257714161777 |
9 | 441142335622307 |
10 | 102003312223231 |
11 | 2a5573a8590331 |
12 | b534b12a65767 |
13 | 44bbb4297c103 |
14 | 1b28db554035d |
15 | bbd518466a71 |
hex | 5cc57f30e3ff |
102003312223231 has 2 divisors, whose sum is σ = 102003312223232. Its totient is φ = 102003312223230.
The previous prime is 102003312223207. The next prime is 102003312223243. The reversal of 102003312223231 is 132322213300201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102003312223231 is a prime.
It is a super-2 number, since 2×1020033122232312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102003312223196 and 102003312223205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102003312223261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51001656111615 + 51001656111616.
It is an arithmetic number, because the mean of its divisors is an integer number (51001656111616).
Almost surely, 2102003312223231 is an apocalyptic number.
102003312223231 is a deficient number, since it is larger than the sum of its proper divisors (1).
102003312223231 is an equidigital number, since it uses as much as digits as its factorization.
102003312223231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 102003312223231 its reverse (132322213300201), we get a palindrome (234325525523432).
The spelling of 102003312223231 in words is "one hundred two trillion, three billion, three hundred twelve million, two hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •