Base | Representation |
---|---|
bin | 10110101111001110001000… |
… | …111111111101010000011010 |
3 | 111010002002200212002210102212 |
4 | 112233032020333331100122 |
5 | 101101413120114120442 |
6 | 552404143353355122 |
7 | 30030623221055525 |
oct | 2657161077752032 |
9 | 433062625083385 |
10 | 100002022020122 |
11 | 2995568a423892 |
12 | b27108aa08aa2 |
13 | 43a51c5030061 |
14 | 1a9a1a359dbbc |
15 | b86437081a82 |
hex | 5af388ffd41a |
100002022020122 has 8 divisors (see below), whose sum is σ = 152115751805472. Its totient is φ = 49296771418300.
The previous prime is 100002022020049. The next prime is 100002022020127. The reversal of 100002022020122 is 221020220200001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1000020220201223 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 100002022020097 and 100002022020106.
It is not an unprimeable number, because it can be changed into a prime (100002022020127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 352119795704 + ... + 352119795987.
It is an arithmetic number, because the mean of its divisors is an integer number (19014468975684).
Almost surely, 2100002022020122 is an apocalyptic number.
100002022020122 is a deficient number, since it is larger than the sum of its proper divisors (52113729785350).
100002022020122 is an equidigital number, since it uses as much as digits as its factorization.
100002022020122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704239591764.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 100002022020122 its reverse (221020220200001), we get a palindrome (321022242220123).
The spelling of 100002022020122 in words is "one hundred trillion, two billion, twenty-two million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •