Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …0000010110101000000001 |
3 | 1022102000000212020220102201 |
4 | 2101201111000112220001 |
5 | 2302320211131133441 |
6 | 33133553115113201 |
7 | 2051325022454503 |
oct | 221412500265001 |
9 | 38360025226381 |
10 | 10000110021121 |
11 | 320602844a570 |
12 | 1156108742801 |
13 | 577010b9a38c |
14 | 2680179abd73 |
15 | 1251d4926c31 |
hex | 91855016a01 |
10000110021121 has 16 divisors (see below), whose sum is σ = 11594869079040. Its totient is φ = 8528918083920.
The previous prime is 10000110021107. The next prime is 10000110021137. The reversal of 10000110021121 is 12112001100001.
It is a cyclic number.
It is not a de Polignac number, because 10000110021121 - 223 = 10000101632513 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10000110021098 and 10000110021107.
It is not an unprimeable number, because it can be changed into a prime (10000110021101) 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, 232247485 + ... + 232290538.
It is an arithmetic number, because the mean of its divisors is an integer number (724679317440).
Almost surely, 210000110021121 is an apocalyptic number.
10000110021121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10000110021121 is a deficient number, since it is larger than the sum of its proper divisors (1594759057919).
10000110021121 is a wasteful number, since it uses less digits than its factorization.
10000110021121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 464538156.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10000110021121 its reverse (12112001100001), we get a palindrome (22112111121122).
The spelling of 10000110021121 in words is "ten trillion, one hundred ten million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •