Base | Representation |
---|---|
bin | 11110100011110011000… |
… | …000010111101100110100 |
3 | 21102202112002000011012001 |
4 | 132203303000113230310 |
5 | 233401320334013022 |
6 | 4244423014105044 |
7 | 304502322662014 |
oct | 36436300275464 |
9 | 7382462004161 |
10 | 2100021001012 |
11 | 73a6831202a0 |
12 | 29abb894b184 |
13 | 123053517a3c |
14 | 738da619c44 |
15 | 3995deb4b27 |
hex | 1e8f3017b34 |
2100021001012 has 24 divisors (see below), whose sum is σ = 4009815996480. Its totient is φ = 954391906560.
The previous prime is 2100021001003. The next prime is 2100021001019. The reversal of 2100021001012 is 2101001200012.
It is a self number, because there is not a number n which added to its sum of digits gives 2100021001012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100021001019) 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, 3816712 + ... + 4332127.
It is an arithmetic number, because the mean of its divisors is an integer number (167075666520).
Almost surely, 22100021001012 is an apocalyptic number.
2100021001012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2100021001012 is a deficient number, since it is larger than the sum of its proper divisors (1909794995468).
2100021001012 is a wasteful number, since it uses less digits than its factorization.
2100021001012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8154711 (or 8154709 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2100021001012 its reverse (2101001200012), we get a palindrome (4201022201024).
It can be divided in two parts, 21000 and 21001012, that added together give a palindrome (21022012).
The spelling of 2100021001012 in words is "two trillion, one hundred billion, twenty-one million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •