Base | Representation |
---|---|
bin | 10111001100010011000001… |
… | …000011010000010010001111 |
3 | 111101011010010220002211211022 |
4 | 113030103001003100102033 |
5 | 101332132222240414411 |
6 | 1000534113110544355 |
7 | 30325160054300162 |
oct | 2714230103202217 |
9 | 441133126084738 |
10 | 102000122201231 |
11 | 2a556010932611 |
12 | b5343826680bb |
13 | 44bb754ac5127 |
14 | 1b28b919d1ad9 |
15 | bbd3cd389edb |
hex | 5cc4c10d048f |
102000122201231 has 2 divisors, whose sum is σ = 102000122201232. Its totient is φ = 102000122201230.
The previous prime is 102000122201191. The next prime is 102000122201261. The reversal of 102000122201231 is 132102221000201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102000122201231 - 238 = 101725244294287 is a prime.
It is a super-2 number, since 2×1020001222012312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102000122201261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000061100615 + 51000061100616.
It is an arithmetic number, because the mean of its divisors is an integer number (51000061100616).
Almost surely, 2102000122201231 is an apocalyptic number.
102000122201231 is a deficient number, since it is larger than the sum of its proper divisors (1).
102000122201231 is an equidigital number, since it uses as much as digits as its factorization.
102000122201231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 102000122201231 its reverse (132102221000201), we get a palindrome (234102343201432).
The spelling of 102000122201231 in words is "one hundred two trillion, one hundred twenty-two million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •