Base | Representation |
---|---|
bin | 10010101000010000… |
… | …00000110011110000 |
3 | 221211000020202110201 |
4 | 21110020000303300 |
5 | 130440314234300 |
6 | 4332231004544 |
7 | 502561553563 |
oct | 112410006360 |
9 | 27730222421 |
10 | 10001321200 |
11 | 4272537712 |
12 | 1b31509754 |
13 | c35060950 |
14 | 6ac3c84da |
15 | 3d806e66a |
hex | 254200cf0 |
10001321200 has 120 divisors (see below), whose sum is σ = 26231963408. Its totient is φ = 3642071040.
The previous prime is 10001321191. The next prime is 10001321249. The reversal of 10001321200 is 212310001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 366427 + ... + 392773.
Almost surely, 210001321200 is an apocalyptic number.
10001321200 is a gapful number since it is divisible by the number (10) 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 10001321200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13115981704).
10001321200 is an abundant number, since it is smaller than the sum of its proper divisors (16230642208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001321200 is a wasteful number, since it uses less digits than its factorization.
10001321200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26451 (or 26440 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 10001321200 its reverse (212310001), we get a palindrome (10213631201).
The spelling of 10001321200 in words is "ten billion, one million, three hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •