Base | Representation |
---|---|
bin | 10111001110000101011110… |
… | …100001011100100101011011 |
3 | 111101120212101002001122020022 |
4 | 113032011132201130211123 |
5 | 101341140422421120011 |
6 | 1001110400314221055 |
7 | 30340100500610321 |
oct | 2716053641344533 |
9 | 441525332048208 |
10 | 102123023223131 |
11 | 2a5a31492a4399 |
12 | b554161a2478b |
13 | 44ca21001a3b1 |
14 | 1b30ad0337d11 |
15 | bc16c2d828db |
hex | 5ce15e85c95b |
102123023223131 has 2 divisors, whose sum is σ = 102123023223132. Its totient is φ = 102123023223130.
The previous prime is 102123023223073. The next prime is 102123023223149. The reversal of 102123023223131 is 131322320321201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102123023223131 is a prime.
It is a super-2 number, since 2×1021230232231312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102123023223131.
It is not a weakly prime, because it can be changed into another prime (102123023223191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51061511611565 + 51061511611566.
It is an arithmetic number, because the mean of its divisors is an integer number (51061511611566).
Almost surely, 2102123023223131 is an apocalyptic number.
102123023223131 is a deficient number, since it is larger than the sum of its proper divisors (1).
102123023223131 is an equidigital number, since it uses as much as digits as its factorization.
102123023223131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 102123023223131 its reverse (131322320321201), we get a palindrome (233445343544332).
The spelling of 102123023223131 in words is "one hundred two trillion, one hundred twenty-three billion, twenty-three million, two hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •