Base | Representation |
---|---|
bin | 1001000110101100011111… |
… | …01000100110000001000110 |
3 | 2121220000100111111202011122 |
4 | 10203112033220212001012 |
5 | 10111012011100200042 |
6 | 110325345241433542 |
7 | 4134326204020010 |
oct | 443261750460106 |
9 | 77800314452148 |
10 | 20021252350022 |
11 | 6419a68aa9180 |
12 | 22b4304a9b8b2 |
13 | b22cc4281a91 |
14 | 4d30689bd1b0 |
15 | 24abeaa2d7d2 |
hex | 12358fa26046 |
20021252350022 has 64 divisors (see below), whose sum is σ = 37483101057024. Its totient is φ = 7792000878240.
The previous prime is 20021252349881. The next prime is 20021252350039. The reversal of 20021252350022 is 22005325212002.
It is a super-2 number, since 2×200212523500222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20021252349973 and 20021252350000.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 615965423 + ... + 615997925.
It is an arithmetic number, because the mean of its divisors is an integer number (585673454016).
Almost surely, 220021252350022 is an apocalyptic number.
20021252350022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20021252350022 is a deficient number, since it is larger than the sum of its proper divisors (17461848707002).
20021252350022 is a wasteful number, since it uses less digits than its factorization.
20021252350022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36753.
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 20021252350022 its reverse (22005325212002), we get a palindrome (42026577562024).
The spelling of 20021252350022 in words is "twenty trillion, twenty-one billion, two hundred fifty-two million, three hundred fifty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •