Base | Representation |
---|---|
bin | 11101110110110000000… |
… | …101101001010010000110 |
3 | 21021010200021100011101210 |
4 | 131312300011221102012 |
5 | 232103241314420042 |
6 | 4210303334232250 |
7 | 301140614312145 |
oct | 35666005512206 |
9 | 7233607304353 |
10 | 2051653670022 |
11 | 721113012680 |
12 | 29175a7b5686 |
13 | 11b615aab868 |
14 | 7142ca8575c |
15 | 3857cb23a9c |
hex | 1ddb0169486 |
2051653670022 has 16 divisors (see below), whose sum is σ = 4476335280192. Its totient is φ = 621713233320.
The previous prime is 2051653670009. The next prime is 2051653670023. The reversal of 2051653670022 is 2200763561502.
It is a happy number.
It is a super-2 number, since 2×20516536700222 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2051653670023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15542830768 + ... + 15542830899.
It is an arithmetic number, because the mean of its divisors is an integer number (279770955012).
Almost surely, 22051653670022 is an apocalyptic number.
2051653670022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2051653670022 is an abundant number, since it is smaller than the sum of its proper divisors (2424681610170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2051653670022 is a wasteful number, since it uses less digits than its factorization.
2051653670022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31085661683.
The product of its (nonzero) digits is 151200, while the sum is 39.
The spelling of 2051653670022 in words is "two trillion, fifty-one billion, six hundred fifty-three million, six hundred seventy thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •