Base | Representation |
---|---|
bin | 111100010000111… |
… | …0001111000111110 |
3 | 12012220222101120012 |
4 | 1320201301320332 |
5 | 13120130333042 |
6 | 532353023222 |
7 | 101052513365 |
oct | 17041617076 |
9 | 5186871505 |
10 | 2022121022 |
11 | 9484864a9 |
12 | 485254b12 |
13 | 262c2101c |
14 | 1527b67dc |
15 | bc7d1e82 |
hex | 78871e3e |
2022121022 has 8 divisors (see below), whose sum is σ = 3033372672. Its totient is φ = 1010996800.
The previous prime is 2022121001. The next prime is 2022121027. The reversal of 2022121022 is 2201212202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×20221210222 = 8177946855228648968, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2022120988 and 2022121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022121027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42947 + ... + 76737.
It is an arithmetic number, because the mean of its divisors is an integer number (379171584).
Almost surely, 22022121022 is an apocalyptic number.
2022121022 is a deficient number, since it is larger than the sum of its proper divisors (1011251650).
2022121022 is a wasteful number, since it uses less digits than its factorization.
2022121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63714.
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 2022121022 is about 44967.9999777620. Note that the first 4 decimals coincide. The cubic root of 2022121022 is about 1264.5491520891.
Adding to 2022121022 its reverse (2201212202), we get a palindrome (4223333224).
The spelling of 2022121022 in words is "two billion, twenty-two million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •