Base | Representation |
---|---|
bin | 10010101001100111… |
… | …111001000011110110 |
3 | 1220200121211202010112 |
4 | 102221213321003312 |
5 | 312003033113042 |
6 | 13111043423022 |
7 | 1306153303052 |
oct | 225147710366 |
9 | 56617752115 |
10 | 20025676022 |
11 | 8546a76880 |
12 | 3a6a684a72 |
13 | 1b71ac7751 |
14 | d7d88ac62 |
15 | 7c313d982 |
hex | 4a99f90f6 |
20025676022 has 8 divisors (see below), whose sum is σ = 32769288072. Its totient is φ = 9102580000.
The previous prime is 20025676009. The next prime is 20025676039. The reversal of 20025676022 is 22067652002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 20025676022.
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 3 ways as a sum of consecutive naturals, for example, 455128979 + ... + 455129022.
It is an arithmetic number, because the mean of its divisors is an integer number (4096161009).
Almost surely, 220025676022 is an apocalyptic number.
20025676022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20025676022 is a deficient number, since it is larger than the sum of its proper divisors (12743612050).
20025676022 is a wasteful number, since it uses less digits than its factorization.
20025676022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910258014.
The product of its (nonzero) digits is 20160, while the sum is 32.
The spelling of 20025676022 in words is "twenty billion, twenty-five million, six hundred seventy-six thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •