Base | Representation |
---|---|
bin | 10111001100100111100101… |
… | …101101100100101100010011 |
3 | 111101020020011101011112111010 |
4 | 113030213211231210230103 |
5 | 101333012442300023443 |
6 | 1000552205054222003 |
7 | 30326601344364633 |
oct | 2714474555445423 |
9 | 441206141145433 |
10 | 102022212111123 |
11 | 2a564417028897 |
12 | b5387084b4903 |
13 | 44c0865467025 |
14 | 1b29c896986c3 |
15 | bbdc72828733 |
hex | 5cc9e5b64b13 |
102022212111123 has 16 divisors (see below), whose sum is σ = 136136846200320. Its totient is φ = 67961211563616.
The previous prime is 102022212111031. The next prime is 102022212111143. The reversal of 102022212111123 is 321111212220201.
It is not a de Polignac number, because 102022212111123 - 224 = 102022195333907 is a prime.
It is a super-2 number, since 2×1020222121111232 (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 102022212111123.
It is not an unprimeable number, because it can be changed into a prime (102022212111143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19756336 + ... + 24379442.
It is an arithmetic number, because the mean of its divisors is an integer number (8508552887520).
Almost surely, 2102022212111123 is an apocalyptic number.
102022212111123 is a deficient number, since it is larger than the sum of its proper divisors (34114634089197).
102022212111123 is a wasteful number, since it uses less digits than its factorization.
102022212111123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4628906.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 102022212111123 its reverse (321111212220201), we get a palindrome (423133424331324).
The spelling of 102022212111123 in words is "one hundred two trillion, twenty-two billion, two hundred twelve million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •