Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001010001001100011111111 |
3 | 111010102122202111112121021010 |
4 | 112300223100022021203333 |
5 | 101110032344012401421 |
6 | 552522120215210303 |
7 | 30041062610651451 |
oct | 2660532012114377 |
9 | 433378674477233 |
10 | 100102000122111 |
11 | 29994024462659 |
12 | b288531376993 |
13 | 43b17691434a0 |
14 | 1aa0d697602d1 |
15 | b88d393e3076 |
hex | 5b0ad02898ff |
100102000122111 has 32 divisors (see below), whose sum is σ = 148707248195520. Its totient is φ = 59471201664000.
The previous prime is 100102000122067. The next prime is 100102000122119. The reversal of 100102000122111 is 111221000201001.
It is not a de Polignac number, because 100102000122111 - 223 = 100101991733503 is a prime.
It is a super-2 number, since 2×1001020001221112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102000122119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7168011 + ... + 15861411.
It is an arithmetic number, because the mean of its divisors is an integer number (4647101506110).
Almost surely, 2100102000122111 is an apocalyptic number.
100102000122111 is a deficient number, since it is larger than the sum of its proper divisors (48605248073409).
100102000122111 is a wasteful number, since it uses less digits than its factorization.
100102000122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8703627.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100102000122111 its reverse (111221000201001), we get a palindrome (211323000323112).
The spelling of 100102000122111 in words is "one hundred trillion, one hundred two billion, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •