Base | Representation |
---|---|
bin | 1001001101001000011111… |
… | …1010110110111101111001 |
3 | 1022211120122110021002121120 |
4 | 2103102013322312331321 |
5 | 2311311231131144113 |
6 | 33305343101055453 |
7 | 2063143230411663 |
oct | 223220772667571 |
9 | 38746573232546 |
10 | 10121223303033 |
11 | 3252428770887 |
12 | 1175689257589 |
13 | 585572905a2b |
14 | 26dc26b0d533 |
15 | 1284224d8a23 |
hex | 93487eb6f79 |
10121223303033 has 16 divisors (see below), whose sum is σ = 14289593071680. Its totient is φ = 6350212714496.
The previous prime is 10121223303017. The next prime is 10121223303053. The reversal of 10121223303033 is 33030332212101.
It is a cyclic number.
It is not a de Polignac number, because 10121223303033 - 24 = 10121223303017 is a prime.
It is a super-2 number, since 2×101212233030332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121223302994 and 10121223303012.
It is not an unprimeable number, because it can be changed into a prime (10121223303053) 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, 4692735 + ... + 6501092.
It is an arithmetic number, because the mean of its divisors is an integer number (893099566980).
Almost surely, 210121223303033 is an apocalyptic number.
It is an amenable number.
10121223303033 is a deficient number, since it is larger than the sum of its proper divisors (4168369768647).
10121223303033 is a wasteful number, since it uses less digits than its factorization.
10121223303033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11211576.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 10121223303033 its reverse (33030332212101), we get a palindrome (43151555515134).
The spelling of 10121223303033 in words is "ten trillion, one hundred twenty-one billion, two hundred twenty-three million, three hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •