Base | Representation |
---|---|
bin | 1001001100011111110110… |
… | …0100000011000110101001 |
3 | 1022210112111000222020020011 |
4 | 2103013331210003012221 |
5 | 2311121404401224113 |
6 | 33300340244531521 |
7 | 2062305650116510 |
oct | 223077544030651 |
9 | 38715430866204 |
10 | 10110312133033 |
11 | 3248839695312 |
12 | 11735430b0ba1 |
13 | 584524210918 |
14 | 26d4ad963677 |
15 | 127ed464463d |
hex | 931fd9031a9 |
10110312133033 has 16 divisors (see below), whose sum is σ = 11754768968064. Its totient is φ = 8516145951360.
The previous prime is 10110312133021. The next prime is 10110312133049. The reversal of 10110312133033 is 33033121301101.
It is a cyclic number.
It is not a de Polignac number, because 10110312133033 - 25 = 10110312133001 is a prime.
It is a super-2 number, since 2×101103121330332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10110312132995 and 10110312133013.
It is not an unprimeable number, because it can be changed into a prime (10110312133013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10323535 + ... + 11260372.
It is an arithmetic number, because the mean of its divisors is an integer number (734673060504).
Almost surely, 210110312133033 is an apocalyptic number.
It is an amenable number.
10110312133033 is a deficient number, since it is larger than the sum of its proper divisors (1644456835031).
10110312133033 is a wasteful number, since it uses less digits than its factorization.
10110312133033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21585072.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 10110312133033 its reverse (33033121301101), we get a palindrome (43143433434134).
The spelling of 10110312133033 in words is "ten trillion, one hundred ten billion, three hundred twelve million, one hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •