Base | Representation |
---|---|
bin | 111111000101001… |
… | …0000111011110110 |
3 | 12110111210102211011 |
4 | 1332022100323312 |
5 | 13313323320042 |
6 | 550010302434 |
7 | 103310654566 |
oct | 17612207366 |
9 | 5414712734 |
10 | 2116620022 |
11 | 99685aa50 |
12 | 4b0a27a1a |
13 | 2796899aa |
14 | 161174da6 |
15 | c5c4ba17 |
hex | 7e290ef6 |
2116620022 has 8 divisors (see below), whose sum is σ = 3463560072. Its totient is φ = 962100000.
The previous prime is 2116620017. The next prime is 2116620073. The reversal of 2116620022 is 2200266112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 96210001 = 2116620022 / (2 + 1 + 1 + 6 + 6 + 2 + 0 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 2116619975 and 2116620002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48104979 + ... + 48105022.
It is an arithmetic number, because the mean of its divisors is an integer number (432945009).
Almost surely, 22116620022 is an apocalyptic number.
2116620022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2116620022 is a deficient number, since it is larger than the sum of its proper divisors (1346940050).
2116620022 is a wasteful number, since it uses less digits than its factorization.
2116620022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96210014.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 2116620022 is about 46006.7388759516. The cubic root of 2116620022 is about 1283.9485859629.
Adding to 2116620022 its reverse (2200266112), we get a palindrome (4316886134).
The spelling of 2116620022 in words is "two billion, one hundred sixteen million, six hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •