Base | Representation |
---|---|
bin | 10011101111101111… |
… | …001101110001101000 |
3 | 2000201121022020122022 |
4 | 103233233031301220 |
5 | 321410203013000 |
6 | 13423504244012 |
7 | 1350256014665 |
oct | 235757156150 |
9 | 60647266568 |
10 | 21202001000 |
11 | 8a9aa82184 |
12 | 4138610608 |
13 | 1ccb71cb2b |
14 | 1051bb6a6c |
15 | 84154e585 |
hex | 4efbcdc68 |
21202001000 has 32 divisors (see below), whose sum is σ = 49612684680. Its totient is φ = 8480800000.
The previous prime is 21202000997. The next prime is 21202001003. The reversal of 21202001000 is 10020212.
It is an interprime number because it is at equal distance from previous prime (21202000997) and next prime (21202001003).
It can be written as a sum of positive squares in 4 ways, for example, as 12449650084 + 8752350916 = 111578^2 + 93554^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (21202001003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10600001 + ... + 10602000.
Almost surely, 221202001000 is an apocalyptic number.
21202001000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21202001000 is an abundant number, since it is smaller than the sum of its proper divisors (28410683680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21202001000 is a wasteful number, since it uses less digits than its factorization.
21202001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21202022 (or 21202008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 21202001000 its reverse (10020212), we get a palindrome (21212021212).
The spelling of 21202001000 in words is "twenty-one billion, two hundred two million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •