Base | Representation |
---|---|
bin | 10010101011101010… |
… | …11101101100010000 |
3 | 221220000020110111101 |
4 | 21111311131230100 |
5 | 131020140410300 |
6 | 4335133554144 |
7 | 503360463664 |
oct | 112565355420 |
9 | 27800213441 |
10 | 10030013200 |
11 | 4287754409 |
12 | 1b3b045954 |
13 | c3ac9846c |
14 | 6b21368a4 |
15 | 3da83ab6a |
hex | 255d5db10 |
10030013200 has 60 divisors (see below), whose sum is σ = 24109863988. Its totient is φ = 4009881600.
The previous prime is 10030013183. The next prime is 10030013221. The reversal of 10030013200 is 231003001.
10030013200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 728568064 + 9301445136 = 26992^2 + 96444^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 906904 + ... + 917896.
Almost surely, 210030013200 is an apocalyptic number.
10030013200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10030013200 is an abundant number, since it is smaller than the sum of its proper divisors (14079850788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10030013200 is a wasteful number, since it uses less digits than its factorization.
10030013200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13292 (or 13281 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 10030013200 its reverse (231003001), we get a palindrome (10261016201).
The spelling of 10030013200 in words is "ten billion, thirty million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •