Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …101100001111011001110011 |
3 | 111101012011112111012122012122 |
4 | 113030131100230033121303 |
5 | 101332322234214201003 |
6 | 1000543132411144455 |
7 | 30326026462235405 |
oct | 2714352054173163 |
9 | 441164474178178 |
10 | 102011122022003 |
11 | 2a55a745a58787 |
12 | b53653244512b |
13 | 44bc7b898900c |
14 | 1b29516856b75 |
15 | bbd823de1238 |
hex | 5cc750b0f673 |
102011122022003 has 2 divisors, whose sum is σ = 102011122022004. Its totient is φ = 102011122022002.
The previous prime is 102011122021967. The next prime is 102011122022041. The reversal of 102011122022003 is 300220221110201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102011122022003 - 28 = 102011122021747 is a prime.
It is a super-2 number, since 2×1020111220220032 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102011122322003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005561011001 + 51005561011002.
It is an arithmetic number, because the mean of its divisors is an integer number (51005561011002).
Almost surely, 2102011122022003 is an apocalyptic number.
102011122022003 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011122022003 is an equidigital number, since it uses as much as digits as its factorization.
102011122022003 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 102011122022003 its reverse (300220221110201), we get a palindrome (402231343132204).
The spelling of 102011122022003 in words is "one hundred two trillion, eleven billion, one hundred twenty-two million, twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •