Base | Representation |
---|---|
bin | 111000011001001001… |
… | …1011001011100010001 |
3 | 102120120212201100020122 |
4 | 1300302103121130101 |
5 | 3441004333430113 |
6 | 131344534120025 |
7 | 11515021525256 |
oct | 1606223313421 |
9 | 376525640218 |
10 | 121103030033 |
11 | 473a5559997 |
12 | 1b5791b0015 |
13 | b55c88926b |
14 | 5c0ba3342d |
15 | 323bc39408 |
hex | 1c324d9711 |
121103030033 has 16 divisors (see below), whose sum is σ = 130984620480. Its totient is φ = 111553545216.
The previous prime is 121103030023. The next prime is 121103030039. The reversal of 121103030033 is 330030301121.
It is not a de Polignac number, because 121103030033 - 24 = 121103030017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 121103029993 and 121103030020.
It is not an unprimeable number, because it can be changed into a prime (121103030039) 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 15 ways as a sum of consecutive naturals, for example, 250088 + ... + 552041.
It is an arithmetic number, because the mean of its divisors is an integer number (8186538780).
Almost surely, 2121103030033 is an apocalyptic number.
It is an amenable number.
121103030033 is a deficient number, since it is larger than the sum of its proper divisors (9881590447).
121103030033 is a wasteful number, since it uses less digits than its factorization.
121103030033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802336.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 121103030033 its reverse (330030301121), we get a palindrome (451133331154).
The spelling of 121103030033 in words is "one hundred twenty-one billion, one hundred three million, thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •