Base | Representation |
---|---|
bin | 10010110100000001… |
… | …11100000101010010 |
3 | 222001220011202211201 |
4 | 21122000330011102 |
5 | 131141113131010 |
6 | 4350120501414 |
7 | 505201455346 |
oct | 113200740522 |
9 | 28056152751 |
10 | 10100130130 |
11 | 4313295292 |
12 | 1b5a61a86a |
13 | c4c67827c |
14 | 6bb589626 |
15 | 3e1a8b23a |
hex | 25a03c152 |
10100130130 has 32 divisors (see below), whose sum is σ = 18814213440. Its totient is φ = 3900836160.
The previous prime is 10100130127. The next prime is 10100130133. The reversal of 10100130130 is 3103100101.
It is an interprime number because it is at equal distance from previous prime (10100130127) and next prime (10100130133).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (10100130133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55720 + ... + 152659.
It is an arithmetic number, because the mean of its divisors is an integer number (587944170).
Almost surely, 210100130130 is an apocalyptic number.
10100130130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100130130 is a deficient number, since it is larger than the sum of its proper divisors (8714083310).
10100130130 is a wasteful number, since it uses less digits than its factorization.
10100130130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208554.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 10100130130 its reverse (3103100101), we get a palindrome (13203230231).
It can be divided in two parts, 101001 and 30130, that added together give a palindrome (131131).
The spelling of 10100130130 in words is "ten billion, one hundred million, one hundred thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •