Base | Representation |
---|---|
bin | 10110110000101110100100… |
… | …010110000010110100011011 |
3 | 111010102222221121002122102010 |
4 | 112300232210112002310123 |
5 | 101110112141330310021 |
6 | 552523505344041003 |
7 | 30041250045340413 |
oct | 2660564426026433 |
9 | 433388847078363 |
10 | 100105560010011 |
11 | 29995590974076 |
12 | b289165603163 |
13 | 43b1bb581aa2a |
14 | 1aa11c646b643 |
15 | b88e96bce976 |
hex | 5b0ba4582d1b |
100105560010011 has 8 divisors (see below), whose sum is σ = 133477464144960. Its totient is φ = 66735347940872.
The previous prime is 100105560009979. The next prime is 100105560010031. The reversal of 100105560010011 is 110010065501001.
It is a happy number.
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 100105560010011 - 25 = 100105560009979 is a prime.
It is a super-2 number, since 2×1001055600100112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100105560010011.
It is not an unprimeable number, because it can be changed into a prime (100105560010031) 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, 422878401 + ... + 423115058.
It is an arithmetic number, because the mean of its divisors is an integer number (16684683018120).
Almost surely, 2100105560010011 is an apocalyptic number.
100105560010011 is a deficient number, since it is larger than the sum of its proper divisors (33371904134949).
100105560010011 is an equidigital number, since it uses as much as digits as its factorization.
100105560010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 846032905.
The product of its (nonzero) digits is 150, while the sum is 21.
The spelling of 100105560010011 in words is "one hundred trillion, one hundred five billion, five hundred sixty million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •