Base | Representation |
---|---|
bin | 10111001111101011111001… |
… | …110001100100110100001111 |
3 | 111101222101020200201112220102 |
4 | 113033223321301210310033 |
5 | 101344441142014231111 |
6 | 1001233105351241315 |
7 | 30351043044632243 |
oct | 2717537161446417 |
9 | 441871220645812 |
10 | 102233002102031 |
11 | 2a635855528949 |
12 | b57153567923b |
13 | 45076b90307b8 |
14 | 1b361647c0423 |
15 | bc44ad1a713b |
hex | 5cfaf9c64d0f |
102233002102031 has 2 divisors, whose sum is σ = 102233002102032. Its totient is φ = 102233002102030.
The previous prime is 102233002102019. The next prime is 102233002102061. The reversal of 102233002102031 is 130201200332201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102233002102031 - 230 = 102231928360207 is a prime.
It is a super-2 number, since 2×1022330021020312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102233002101994 and 102233002102012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102233002102061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51116501051015 + 51116501051016.
It is an arithmetic number, because the mean of its divisors is an integer number (51116501051016).
Almost surely, 2102233002102031 is an apocalyptic number.
102233002102031 is a deficient number, since it is larger than the sum of its proper divisors (1).
102233002102031 is an equidigital number, since it uses as much as digits as its factorization.
102233002102031 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 20.
Adding to 102233002102031 its reverse (130201200332201), we get a palindrome (232434202434232).
The spelling of 102233002102031 in words is "one hundred two trillion, two hundred thirty-three billion, two million, one hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •