Base | Representation |
---|---|
bin | 111000100000000000… |
… | …0101101011001000001 |
3 | 102121011220110122020111 |
4 | 1301000000231121001 |
5 | 3441442222341113 |
6 | 131423431311321 |
7 | 11523513404602 |
oct | 1610000553101 |
9 | 377156418214 |
10 | 121333012033 |
11 | 4750335a862 |
12 | 1b62221b541 |
13 | b59841029c |
14 | 5c303bbda9 |
15 | 325201713d |
hex | 1c4002d641 |
121333012033 has 8 divisors (see below), whose sum is σ = 122169479400. Its totient is φ = 120496840320.
The previous prime is 121333012007. The next prime is 121333012039. The reversal of 121333012033 is 330210333121.
It can be written as a sum of positive squares in 4 ways, for example, as 122500624 + 121210511409 = 11068^2 + 348153^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121333012033 - 25 = 121333012001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121333011995 and 121333012013.
It is not an unprimeable number, because it can be changed into a prime (121333012039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 783843 + ... + 925783.
It is an arithmetic number, because the mean of its divisors is an integer number (15271184925).
Almost surely, 2121333012033 is an apocalyptic number.
It is an amenable number.
121333012033 is a deficient number, since it is larger than the sum of its proper divisors (836467367).
121333012033 is a wasteful number, since it uses less digits than its factorization.
121333012033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147827.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 121333012033 its reverse (330210333121), we get a palindrome (451543345154).
The spelling of 121333012033 in words is "one hundred twenty-one billion, three hundred thirty-three million, twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •