Base | Representation |
---|---|
bin | 10110110010001111111100… |
… | …101110011000101001110011 |
3 | 111010210222211200221010211110 |
4 | 112302033330232120221303 |
5 | 101113320312213013021 |
6 | 553043521114244403 |
7 | 30051641145525261 |
oct | 2662177456305163 |
9 | 433728750833743 |
10 | 100210122001011 |
11 | 29a25968440570 |
12 | b2a5487126703 |
13 | 43bba0a4ca219 |
14 | 1aa62a5333431 |
15 | b8ba666a0476 |
hex | 5b23fcb98a73 |
100210122001011 has 128 divisors (see below), whose sum is σ = 162925544641536. Its totient is φ = 54083650682880.
The previous prime is 100210122000971. The next prime is 100210122001169. The reversal of 100210122001011 is 110100221012001.
It is not a de Polignac number, because 100210122001011 - 27 = 100210122000883 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100210122001411) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 123910620 + ... + 124716726.
It is an arithmetic number, because the mean of its divisors is an integer number (1272855817512).
Almost surely, 2100210122001011 is an apocalyptic number.
100210122001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100210122001011 is a deficient number, since it is larger than the sum of its proper divisors (62715422640525).
100210122001011 is a wasteful number, since it uses less digits than its factorization.
100210122001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 806341.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100210122001011 its reverse (110100221012001), we get a palindrome (210310343013012).
It can be divided in two parts, 100210 and 122001011, that added together give a palindrome (122101221).
The spelling of 100210122001011 in words is "one hundred trillion, two hundred ten billion, one hundred twenty-two million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •