Base | Representation |
---|---|
bin | 10010101010100000… |
… | …11101110001011000 |
3 | 221212022222200222011 |
4 | 21111100131301120 |
5 | 131010200023300 |
6 | 4334150035304 |
7 | 503212160011 |
oct | 112520356130 |
9 | 27768880864 |
10 | 10020314200 |
11 | 428222a406 |
12 | 1b37948b34 |
13 | c38c80900 |
14 | 6b0b30008 |
15 | 3d9a71eba |
hex | 25541dc58 |
10020314200 has 144 divisors (see below), whose sum is σ = 25518288600. Its totient is φ = 3657139200.
The previous prime is 10020314197. The next prime is 10020314207. The reversal of 10020314200 is 241302001.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020314207) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 3006535 + ... + 3009865.
Almost surely, 210020314200 is an apocalyptic number.
10020314200 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 10020314200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12759144300).
10020314200 is an abundant number, since it is smaller than the sum of its proper divisors (15497974400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10020314200 is a wasteful number, since it uses less digits than its factorization.
10020314200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3462 (or 3440 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 10020314200 its reverse (241302001), we get a palindrome (10261616201).
The spelling of 10020314200 in words is "ten billion, twenty million, three hundred fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •