Base | Representation |
---|---|
bin | 10010110110011010… |
… | …01010000000010100 |
3 | 222010021202212012121 |
4 | 21123031022000110 |
5 | 131211222010400 |
6 | 4352113025324 |
7 | 505533342112 |
oct | 113315120024 |
9 | 28107685177 |
10 | 10120110100 |
11 | 43235a1561 |
12 | 1b65255244 |
13 | c53852539 |
14 | 6c00aaab2 |
15 | 3e36d621a |
hex | 25b34a014 |
10120110100 has 36 divisors (see below), whose sum is σ = 22100549884. Its totient is φ = 4022254080.
The previous prime is 10120110097. The next prime is 10120110109. The reversal of 10120110100 is 101102101.
It can be written as a sum of positive squares in 6 ways, for example, as 3358666116 + 6761443984 = 57954^2 + 82228^2 .
It is a super-2 number, since 2×101201101002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120110109) 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 11 ways as a sum of consecutive naturals, for example, 306597 + ... + 337996.
Almost surely, 210120110100 is an apocalyptic number.
10120110100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10120110100 is an abundant number, since it is smaller than the sum of its proper divisors (11980439784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10120110100 is a wasteful number, since it uses less digits than its factorization.
10120110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644764 (or 644757 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10120110100 its reverse (101102101), we get a palindrome (10221212201).
The spelling of 10120110100 in words is "ten billion, one hundred twenty million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •