Base | Representation |
---|---|
bin | 10010110110101001… |
… | …10111111000100110 |
3 | 222010102120122010221 |
4 | 21123110313320212 |
5 | 131212231224110 |
6 | 4352224234554 |
7 | 505556465632 |
oct | 113324677046 |
9 | 28112518127 |
10 | 10122133030 |
11 | 43247533a9 |
12 | 1b65a6ba5a |
13 | c540b0239 |
14 | 6c0475dc2 |
15 | 3e39857da |
hex | 25b537e26 |
10122133030 has 96 divisors (see below), whose sum is σ = 20244186144. Its totient is φ = 3630692352.
The previous prime is 10122133009. The next prime is 10122133037. The reversal of 10122133030 is 3033122101.
It is a super-3 number, since 3×101221330303 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10122132995 and 10122133013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122133037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11866084 + ... + 11866936.
It is an arithmetic number, because the mean of its divisors is an integer number (210876939).
Almost surely, 210122133030 is an apocalyptic number.
10122133030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10122133030 is a deficient number, since it is larger than the sum of its proper divisors (10122053114).
10122133030 is a wasteful number, since it uses less digits than its factorization.
10122133030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1018 (or 989 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10122133030 its reverse (3033122101), we get a palindrome (13155255131).
The spelling of 10122133030 in words is "ten billion, one hundred twenty-two million, one hundred thirty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •