Base | Representation |
---|---|
bin | 1001001101000111101010… |
… | …1111110011101001010001 |
3 | 1022211120002001102002020100 |
4 | 2103101322233303221101 |
5 | 2311310303042131113 |
6 | 33305305124203013 |
7 | 2063134605056130 |
oct | 223217257635121 |
9 | 38746061362210 |
10 | 10121002302033 |
11 | 3252324a44527 |
12 | 1175627239469 |
13 | 585538ba77cc |
14 | 26dc05621917 |
15 | 12840cdd1d73 |
hex | 9347abf3a51 |
10121002302033 has 24 divisors (see below), whose sum is σ = 16707796604928. Its totient is φ = 5783391718272.
The previous prime is 10121002302031. The next prime is 10121002302077. The reversal of 10121002302033 is 33020320012101.
It is not a de Polignac number, because 10121002302033 - 21 = 10121002302031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10121002301997 and 10121002302015.
It is not an unprimeable number, because it can be changed into a prime (10121002302031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11100985 + ... + 11978057.
It is an arithmetic number, because the mean of its divisors is an integer number (696158191872).
Almost surely, 210121002302033 is an apocalyptic number.
It is an amenable number.
10121002302033 is a deficient number, since it is larger than the sum of its proper divisors (6586794302895).
10121002302033 is a wasteful number, since it uses less digits than its factorization.
10121002302033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1060253 (or 1060250 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 10121002302033 its reverse (33020320012101), we get a palindrome (43141322314134).
It can be divided in two parts, 1012100 and 2302033, that added together give a palindrome (3314133).
The spelling of 10121002302033 in words is "ten trillion, one hundred twenty-one billion, two million, three hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •