Base | Representation |
---|---|
bin | 1001000110001100101110… |
… | …1011011010100111000001 |
3 | 1022102012011121200011222110 |
4 | 2101203023223122213001 |
5 | 2302333300330133441 |
6 | 33134522441125533 |
7 | 2051425246623306 |
oct | 221431353324701 |
9 | 38365147604873 |
10 | 10002101021121 |
11 | 320695a2aa310 |
12 | 11565834898a9 |
13 | 57726a5130a1 |
14 | 2681661a30ad |
15 | 12529e60cb16 |
hex | 918cbada9c1 |
10002101021121 has 16 divisors (see below), whose sum is σ = 14570000284608. Its totient is φ = 6052925361600.
The previous prime is 10002101021093. The next prime is 10002101021131. The reversal of 10002101021121 is 12112010120001.
It is not a de Polignac number, because 10002101021121 - 29 = 10002101020609 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10002101021097 and 10002101021106.
It is not an unprimeable number, because it can be changed into a prime (10002101021131) 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, 223828450 + ... + 223873131.
It is an arithmetic number, because the mean of its divisors is an integer number (910625017788).
Almost surely, 210002101021121 is an apocalyptic number.
10002101021121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10002101021121 is a deficient number, since it is larger than the sum of its proper divisors (4567899263487).
10002101021121 is a wasteful number, since it uses less digits than its factorization.
10002101021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447702272.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10002101021121 its reverse (12112010120001), we get a palindrome (22114111141122).
The spelling of 10002101021121 in words is "ten trillion, two billion, one hundred one million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •