Base | Representation |
---|---|
bin | 1001100110000101111111… |
… | …11101110100011111100000 |
3 | 2202201011001020201102001122 |
4 | 10303002333331310133200 |
5 | 10231201001100341000 |
6 | 112513130243151412 |
7 | 4305301101601412 |
oct | 463027775643740 |
9 | 82634036642048 |
10 | 21100100012000 |
11 | 67a5558418579 |
12 | 2449410975568 |
13 | ba0966a080b9 |
14 | 52d370b1a9b2 |
15 | 268cde4e0085 |
hex | 1330bff747e0 |
21100100012000 has 48 divisors (see below), whose sum is σ = 51842945739312. Its totient is φ = 8440040003200.
The previous prime is 21100100011961. The next prime is 21100100012003. The reversal of 21100100012000 is 21000100112.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100100012003) 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, 2637508502 + ... + 2637516501.
It is an arithmetic number, because the mean of its divisors is an integer number (1080061369569).
Almost surely, 221100100012000 is an apocalyptic number.
21100100012000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21100100012000 is an abundant number, since it is smaller than the sum of its proper divisors (30742845727312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21100100012000 is an equidigital number, since it uses as much as digits as its factorization.
21100100012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5275025028 (or 5275025010 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 21100100012000 its reverse (21000100112), we get a palindrome (21121100112112).
The spelling of 21100100012000 in words is "twenty-one trillion, one hundred billion, one hundred million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •