Base | Representation |
---|---|
bin | 10010110101001101… |
… | …11110001001010100 |
3 | 222002120221022000002 |
4 | 21122212332021110 |
5 | 131201141200202 |
6 | 4351114310432 |
7 | 505352301233 |
oct | 113246761124 |
9 | 28076838002 |
10 | 10110100052 |
11 | 4318984898 |
12 | 1b61a28418 |
13 | c51759230 |
14 | 6bca22b1a |
15 | 3e28aa302 |
hex | 25a9be254 |
10110100052 has 24 divisors (see below), whose sum is σ = 19376599200. Its totient is φ = 4587110496.
The previous prime is 10110100037. The next prime is 10110100057. The reversal of 10110100052 is 25000101101.
10110100052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101101000522 (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 (10110100057) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1644602 + ... + 1650737.
It is an arithmetic number, because the mean of its divisors is an integer number (807358300).
Almost surely, 210110100052 is an apocalyptic number.
It is an amenable number.
10110100052 is a deficient number, since it is larger than the sum of its proper divisors (9266499148).
10110100052 is a wasteful number, since it uses less digits than its factorization.
10110100052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3295415 (or 3295413 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 11.
Adding to 10110100052 its reverse (25000101101), we get a palindrome (35110201153).
The spelling of 10110100052 in words is "ten billion, one hundred ten million, one hundred thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •