Base | Representation |
---|---|
bin | 10110110000110100100100… |
… | …010100010100110000001001 |
3 | 111010110121120112212011020210 |
4 | 112300310210110110300021 |
5 | 101110213340003310441 |
6 | 552530452510311333 |
7 | 30041565510416013 |
oct | 2660644424246011 |
9 | 433417515764223 |
10 | 100112002010121 |
11 | 29998297247102 |
12 | b28a462ab8549 |
13 | 43b26a134210a |
14 | 1aa1637c551b3 |
15 | b89222525616 |
hex | 5b0d24514c09 |
100112002010121 has 16 divisors (see below), whose sum is σ = 146208197664000. Its totient is φ = 60649326436608.
The previous prime is 100112002010113. The next prime is 100112002010123. The reversal of 100112002010121 is 121010200211001.
It is not a de Polignac number, because 100112002010121 - 23 = 100112002010113 is a prime.
It is a super-2 number, since 2×1001120020101212 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100112002010097 and 100112002010106.
It is not an unprimeable number, because it can be changed into a prime (100112002010123) 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, 33844488721 + ... + 33844491678.
It is an arithmetic number, because the mean of its divisors is an integer number (9138012354000).
Almost surely, 2100112002010121 is an apocalyptic number.
It is an amenable number.
100112002010121 is a deficient number, since it is larger than the sum of its proper divisors (46096195653879).
100112002010121 is a wasteful number, since it uses less digits than its factorization.
100112002010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67688980448.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100112002010121 its reverse (121010200211001), we get a palindrome (221122202221122).
The spelling of 100112002010121 in words is "one hundred trillion, one hundred twelve billion, two million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •