Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …000000100101101000111010 |
3 | 111010110102200001210101201000 |
4 | 112300302303000211220322 |
5 | 101110200441324323002 |
6 | 552525540121305430 |
7 | 30041500425245355 |
oct | 2660626300455072 |
9 | 433412601711630 |
10 | 100110101011002 |
11 | 29997501179355 |
12 | b28a012335276 |
13 | 43b245a54b874 |
14 | 1aa14d75ab29c |
15 | b891606bb61c |
hex | 5b0cb3025a3a |
100110101011002 has 32 divisors (see below), whose sum is σ = 222467888001600. Its totient is φ = 33369884140464.
The previous prime is 100110101011001. The next prime is 100110101011013. The reversal of 100110101011002 is 200110101011001.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (100110101011001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8354524 + ... + 16432232.
It is an arithmetic number, because the mean of its divisors is an integer number (6952121500050).
Almost surely, 2100110101011002 is an apocalyptic number.
100110101011002 is an abundant number, since it is smaller than the sum of its proper divisors (122357786990598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100110101011002 is a wasteful number, since it uses less digits than its factorization.
100110101011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8307227 (or 8307221 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100110101011002 its reverse (200110101011001), we get a palindrome (300220202022003).
Subtracting 100110101011002 from its reverse (200110101011001), we obtain a palindrome (99999999999999).
The spelling of 100110101011002 in words is "one hundred trillion, one hundred ten billion, one hundred one million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •