Base | Representation |
---|---|
bin | 1001100110011100010110… |
… | …01110100001101110001000 |
3 | 2202202022000120000002111101 |
4 | 10303032023032201232020 |
5 | 10231400040111213000 |
6 | 112522433114511144 |
7 | 4306204343635546 |
oct | 463161316415610 |
9 | 82668016002441 |
10 | 21112100101000 |
11 | 67aa65612aaa7 |
12 | 244b7bb7354b4 |
13 | ba1b29ba128c |
14 | 52db8c75cd96 |
15 | 269292c7be6a |
hex | 13338b3a1b88 |
21112100101000 has 32 divisors (see below), whose sum is σ = 49402314238680. Its totient is φ = 8444840040000.
The previous prime is 21112100100989. The next prime is 21112100101003. The reversal of 21112100101000 is 10100121112.
It can be written as a sum of positive squares in 4 ways, for example, as 12123892235844 + 8988207865156 = 3481938^2 + 2998034^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 (21112100101003) 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, 10556049051 + ... + 10556051050.
Almost surely, 221112100101000 is an apocalyptic number.
21112100101000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21112100101000 is an abundant number, since it is smaller than the sum of its proper divisors (28290214137680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112100101000 is a wasteful number, since it uses less digits than its factorization.
21112100101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21112100122 (or 21112100108 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 21112100101000 its reverse (10100121112), we get a palindrome (21122200222112).
The spelling of 21112100101000 in words is "twenty-one trillion, one hundred twelve billion, one hundred million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •