Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …100010111101010110010011 |
3 | 111010110102200200202011010001 |
4 | 112300302303202331112103 |
5 | 101110201001131133021 |
6 | 552525541042350431 |
7 | 30041500564652536 |
oct | 2660626342752623 |
9 | 433412620664101 |
10 | 100110110021011 |
11 | 29997506272742 |
12 | b28a01535b417 |
13 | 43b245c38492c |
14 | 1aa14d8874a1d |
15 | b8916139b091 |
hex | 5b0cb38bd593 |
100110110021011 has 8 divisors (see below), whose sum is σ = 100132766579664. Its totient is φ = 100087455538560.
The previous prime is 100110110021003. The next prime is 100110110021017. The reversal of 100110110021011 is 110120011011001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100110110021011 - 23 = 100110110021003 is a prime.
It is a super-2 number, since 2×1001101100210112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100110110021017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98035615 + ... + 99051511.
It is an arithmetic number, because the mean of its divisors is an integer number (12516595822458).
Almost surely, 2100110110021011 is an apocalyptic number.
100110110021011 is a deficient number, since it is larger than the sum of its proper divisors (22656558653).
100110110021011 is a wasteful number, since it uses less digits than its factorization.
100110110021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1038101.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 100110110021011 its reverse (110120011011001), we get a palindrome (210230121032012).
The spelling of 100110110021011 in words is "one hundred trillion, one hundred ten billion, one hundred ten million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •