Base | Representation |
---|---|
bin | 1001101001011010001111… |
… | …11011001001101000000000 |
3 | 2210010001011122000212012000 |
4 | 10310231013323021220000 |
5 | 10240032333320210300 |
6 | 113041333342304000 |
7 | 4316443640110566 |
oct | 464550773115000 |
9 | 83101148025160 |
10 | 21214050163200 |
11 | 68399122a4754 |
12 | 2467512588000 |
13 | bab6266c207b |
14 | 534aa0799a36 |
15 | 26bc5d2b2c00 |
hex | 134b47ec9a00 |
21214050163200 has 240 divisors, whose sum is σ = 77865877752960. Its totient is φ = 5657079951360.
The previous prime is 21214050163193. The next prime is 21214050163217. The reversal of 21214050163200 is 236105041212.
21214050163200 is a `hidden beast` number, since 2 + 1 + 21 + 4 + 0 + 5 + 0 + 1 + 632 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30346024 + ... + 31037223.
It is an arithmetic number, because the mean of its divisors is an integer number (324441157304).
Almost surely, 221214050163200 is an apocalyptic number.
21214050163200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21214050163200 is an abundant number, since it is smaller than the sum of its proper divisors (56651827589760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21214050163200 is an equidigital number, since it uses as much as digits as its factorization.
21214050163200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61383284 (or 61383257 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 21214050163200 in words is "twenty-one trillion, two hundred fourteen billion, fifty million, one hundred sixty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •