Base | Representation |
---|---|
bin | 10110110000110010101101… |
… | …000011000101001000110011 |
3 | 111010110102102002121100210021 |
4 | 112300302231003011020303 |
5 | 101110200240224013021 |
6 | 552525522145544311 |
7 | 30041465102212141 |
oct | 2660625503051063 |
9 | 433412362540707 |
10 | 100110001001011 |
11 | 2999745a780371 |
12 | b289ba4945097 |
13 | 43b2442903661 |
14 | 1aa14c81b6591 |
15 | b89156a13c41 |
hex | 5b0cad0c5233 |
100110001001011 has 8 divisors (see below), whose sum is σ = 100676620515600. Its totient is φ = 99543463106400.
The previous prime is 100110001000993. The next prime is 100110001001039. The reversal of 100110001001011 is 110100100011001.
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 100110001001011 - 223 = 100109992612403 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100110001000985 and 100110001001003.
It is not an unprimeable number, because it can be changed into a prime (100110001001111) 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, 17944140 + ... + 22851961.
It is an arithmetic number, because the mean of its divisors is an integer number (12584577564450).
Almost surely, 2100110001001011 is an apocalyptic number.
100110001001011 is a deficient number, since it is larger than the sum of its proper divisors (566619514589).
100110001001011 is a wasteful number, since it uses less digits than its factorization.
100110001001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40809989.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100110001001011 its reverse (110100100011001), we get a palindrome (210210101012012).
The spelling of 100110001001011 in words is "one hundred trillion, one hundred ten billion, one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •