Base | Representation |
---|---|
bin | 1001100011011110001101… |
… | …11101101011011000110000 |
3 | 2202101112112122010021020210 |
4 | 10301233012331223120300 |
5 | 10223212011403231000 |
6 | 112403512114304120 |
7 | 4265631646521432 |
oct | 461570675533060 |
9 | 82345478107223 |
10 | 21010023102000 |
11 | 67703343468a9 |
12 | 2433a72288040 |
13 | b9530cc9805a |
14 | 528c6791c652 |
15 | 2667bb520350 |
hex | 131bc6f6b630 |
21010023102000 has 160 divisors (see below), whose sum is σ = 67740881966784. Its totient is φ = 5602295040000.
The previous prime is 21010023101999. The next prime is 21010023102037. The reversal of 21010023102000 is 20132001012.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 95295892 + ... + 95516108.
Almost surely, 221010023102000 is an apocalyptic number.
21010023102000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21010023102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33870440983392).
21010023102000 is an abundant number, since it is smaller than the sum of its proper divisors (46730858864784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21010023102000 is a wasteful number, since it uses less digits than its factorization.
21010023102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 236144 (or 236128 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 21010023102000 its reverse (20132001012), we get a palindrome (21030155103012).
The spelling of 21010023102000 in words is "twenty-one trillion, ten billion, twenty-three million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •