Base | Representation |
---|---|
bin | 11111000001011011… |
… | …111111100101111001 |
3 | 10011222102212000120100 |
4 | 133001123333211321 |
5 | 1021204342041441 |
6 | 23145155150013 |
7 | 2256312165336 |
oct | 370133774571 |
9 | 104872760510 |
10 | 33310112121 |
11 | 13143765290 |
12 | 65575a5309 |
13 | 31ab0a8020 |
14 | 187dcd798d |
15 | cee527cb6 |
hex | 7c16ff979 |
33310112121 has 24 divisors (see below), whose sum is σ = 56526253056. Its totient is φ = 18635027040.
The previous prime is 33310112081. The next prime is 33310112159. The reversal of 33310112121 is 12121101333.
It is not a de Polignac number, because 33310112121 - 26 = 33310112057 is a prime.
It is a super-2 number, since 2×333101121212 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33310112094 and 33310112103.
It is not an unprimeable number, because it can be changed into a prime (33310112321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12939705 + ... + 12942278.
It is an arithmetic number, because the mean of its divisors is an integer number (2355260544).
Almost surely, 233310112121 is an apocalyptic number.
It is an amenable number.
33310112121 is a deficient number, since it is larger than the sum of its proper divisors (23216140935).
33310112121 is a wasteful number, since it uses less digits than its factorization.
33310112121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25882013 (or 25882010 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 33310112121 its reverse (12121101333), we get a palindrome (45431213454).
The spelling of 33310112121 in words is "thirty-three billion, three hundred ten million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •