Base | Representation |
---|---|
bin | 10110110000110010101101… |
… | …101001001110100010111100 |
3 | 111010110102102210102102012222 |
4 | 112300302231221032202330 |
5 | 101110200300304013040 |
6 | 552525523144144512 |
7 | 30041465253211526 |
oct | 2660625551164274 |
9 | 433412383372188 |
10 | 100110011001020 |
11 | 29997465390539 |
12 | b289ba8168138 |
13 | 43b24449c5217 |
14 | 1aa14c965aa16 |
15 | b8915783bbb5 |
hex | 5b0cada4e8bc |
100110011001020 has 24 divisors (see below), whose sum is σ = 210454435493568. Its totient is φ = 40001449659200.
The previous prime is 100110011001017. The next prime is 100110011001083. The reversal of 100110011001020 is 20100110011001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 100110011000989 and 100110011001007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2659652036 + ... + 2659689675.
It is an arithmetic number, because the mean of its divisors is an integer number (8768934812232).
Almost surely, 2100110011001020 is an apocalyptic number.
100110011001020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100110011001020 is an abundant number, since it is smaller than the sum of its proper divisors (110344424492548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100110011001020 is a wasteful number, since it uses less digits than its factorization.
100110011001020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5319342661 (or 5319342659 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100110011001020 its reverse (20100110011001), we get a palindrome (120210121012021).
The spelling of 100110011001020 in words is "one hundred trillion, one hundred ten billion, eleven million, one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •