Base | Representation |
---|---|
bin | 10111001111010111101101… |
… | …100110011111011000100011 |
3 | 111101220022021211201202010100 |
4 | 113033113231212133120203 |
5 | 101344112242144024443 |
6 | 1001215122241433443 |
7 | 30346344603610563 |
oct | 2717275546373043 |
9 | 441808254652110 |
10 | 102211323033123 |
11 | 2a627640232577 |
12 | b5692a533b883 |
13 | 4505642827785 |
14 | 1b350a9500da3 |
15 | bc3b3ed1e3d3 |
hex | 5cf5ed99f623 |
102211323033123 has 6 divisors (see below), whose sum is σ = 147638577714524. Its totient is φ = 68140882022076.
The previous prime is 102211323033121. The next prime is 102211323033161. The reversal of 102211323033123 is 321330323112201.
102211323033123 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 1 + 1 + 323 + 0 + 331 + 2 + 3 = 666.
It is not a de Polignac number, because 102211323033123 - 21 = 102211323033121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102211323033121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5678406835165 + ... + 5678406835182.
Almost surely, 2102211323033123 is an apocalyptic number.
102211323033123 is a deficient number, since it is larger than the sum of its proper divisors (45427254681401).
102211323033123 is a wasteful number, since it uses less digits than its factorization.
102211323033123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11356813670353 (or 11356813670350 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 102211323033123 its reverse (321330323112201), we get a palindrome (423541646145324).
The spelling of 102211323033123 in words is "one hundred two trillion, two hundred eleven billion, three hundred twenty-three million, thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •