Base | Representation |
---|---|
bin | 1001101001000011110011… |
… | …10011000011110001101000 |
3 | 2210001220001222021210201101 |
4 | 10310201321303003301220 |
5 | 10234333200003013000 |
6 | 113032022032331144 |
7 | 4315536242322352 |
oct | 464417163036150 |
9 | 83056058253641 |
10 | 21202002001000 |
11 | 683479a438107 |
12 | 246510b6a3ab4 |
13 | baa456596802 |
14 | 53427a6020d2 |
15 | 26b7a56cbe6a |
hex | 134879cc3c68 |
21202002001000 has 32 divisors (see below), whose sum is σ = 49612684684680. Its totient is φ = 8480800800000.
The previous prime is 21202002000997. The next prime is 21202002001001. The reversal of 21202002001000 is 10020020212.
It can be written as a sum of positive squares in 4 ways, for example, as 10653134599396 + 10548867401604 = 3263914^2 + 3247902^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (21202002001001) 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, 10601000001 + ... + 10601002000.
Almost surely, 221202002001000 is an apocalyptic number.
21202002001000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21202002001000 is an abundant number, since it is smaller than the sum of its proper divisors (28410682683680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21202002001000 is a wasteful number, since it uses less digits than its factorization.
21202002001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21202002022 (or 21202002008 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 21202002001000 its reverse (10020020212), we get a palindrome (21212022021212).
The spelling of 21202002001000 in words is "twenty-one trillion, two hundred two billion, two million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •