Base | Representation |
---|---|
bin | 1001000110001001011100… |
… | …1110110010101000101001 |
3 | 1022102002220021221200000212 |
4 | 2101202113032302220221 |
5 | 2302330000100231441 |
6 | 33134255245310505 |
7 | 2051364403501634 |
oct | 221422716625051 |
9 | 38362807850025 |
10 | 10001221102121 |
11 | 3206548643127 |
12 | 1156378865435 |
13 | 57715a12a962 |
14 | 2680c1392c1b |
15 | 12524c24aeeb |
hex | 918973b2a29 |
10001221102121 has 16 divisors (see below), whose sum is σ = 10232691068160. Its totient is φ = 9770544005760.
The previous prime is 10001221102109. The next prime is 10001221102177. The reversal of 10001221102121 is 12120112210001.
It is a cyclic number.
It is not a de Polignac number, because 10001221102121 - 210 = 10001221101097 is a prime.
It is a super-3 number, since 3×100012211021213 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10001221102096 and 10001221102105.
It is not an unprimeable number, because it can be changed into a prime (10001221105121) 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, 63860450 + ... + 64016868.
It is an arithmetic number, because the mean of its divisors is an integer number (639543191760).
Almost surely, 210001221102121 is an apocalyptic number.
It is an amenable number.
10001221102121 is a deficient number, since it is larger than the sum of its proper divisors (231469966039).
10001221102121 is a wasteful number, since it uses less digits than its factorization.
10001221102121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158944.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10001221102121 its reverse (12120112210001), we get a palindrome (22121333312122).
The spelling of 10001221102121 in words is "ten trillion, one billion, two hundred twenty-one million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •