Base | Representation |
---|---|
bin | 10011101001101111… |
… | …000100111000110100 |
3 | 2000110120211011121210 |
4 | 103221233010320310 |
5 | 321203413120200 |
6 | 13405510041420 |
7 | 1344624046602 |
oct | 235157047064 |
9 | 60416734553 |
10 | 21101301300 |
11 | 8a49152a92 |
12 | 410a949270 |
13 | 1cb38c2a01 |
14 | 1042682872 |
15 | 8377ac650 |
hex | 4e9bc4e34 |
21101301300 has 72 divisors (see below), whose sum is σ = 61146037792. Its totient is φ = 5618448000.
The previous prime is 21101301251. The next prime is 21101301307. The reversal of 21101301300 is 310310112.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21101301307) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 145095 + ... + 251505.
Almost surely, 221101301300 is an apocalyptic number.
21101301300 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 21101301300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30573018896).
21101301300 is an abundant number, since it is smaller than the sum of its proper divisors (40044736492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21101301300 is a wasteful number, since it uses less digits than its factorization.
21101301300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107089 (or 107082 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 21101301300 its reverse (310310112), we get a palindrome (21411611412).
The spelling of 21101301300 in words is "twenty-one billion, one hundred one million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •