Base | Representation |
---|---|
bin | 11011101111101001110101… |
… | …111110001000101010000101 |
3 | 121000001012002222200212022220 |
4 | 123233221311332020222011 |
5 | 111443202024011231041 |
6 | 1111304044420242553 |
7 | 34462540625364315 |
oct | 3357516576105205 |
9 | 530035088625286 |
10 | 122022000102021 |
11 | 3597526aa50298 |
12 | 11828820b40459 |
13 | 531181884a596 |
14 | 221bc796c9445 |
15 | e19113c81d66 |
hex | 6efa75f88a85 |
122022000102021 has 8 divisors (see below), whose sum is σ = 162706675087104. Its totient is φ = 81342662592480.
The previous prime is 122022000102017. The next prime is 122022000102031. The reversal of 122022000102021 is 120201000220221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122022000102021 - 22 = 122022000102017 is a prime.
It is a super-2 number, since 2×1220220001020212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122022000102031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1334315541 + ... + 1334406986.
It is an arithmetic number, because the mean of its divisors is an integer number (20338334385888).
Almost surely, 2122022000102021 is an apocalyptic number.
It is an amenable number.
122022000102021 is a deficient number, since it is larger than the sum of its proper divisors (40684674985083).
122022000102021 is a wasteful number, since it uses less digits than its factorization.
122022000102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2668737771.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 122022000102021 its reverse (120201000220221), we get a palindrome (242223000322242).
The spelling of 122022000102021 in words is "one hundred twenty-two trillion, twenty-two billion, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •