Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …100011001111100011011010 |
3 | 111010002212112220100010122000 |
4 | 112233111222203033203122 |
5 | 101102031141341023002 |
6 | 552412001200341430 |
7 | 30031330352154405 |
oct | 2657255243174332 |
9 | 433085486303560 |
10 | 100010101111002 |
11 | 299590559013a5 |
12 | b272764614876 |
13 | 43a5bb1a757c4 |
14 | 1a9a72c574d3c |
15 | b8675b4a161c |
hex | 5af56a8cf8da |
100010101111002 has 64 divisors (see below), whose sum is σ = 235166583398400. Its totient is φ = 31416785627760.
The previous prime is 100010101110977. The next prime is 100010101111007. The reversal of 100010101111002 is 200111101010001.
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 (100010101111007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 254976108 + ... + 255368039.
It is an arithmetic number, because the mean of its divisors is an integer number (3674477865600).
Almost surely, 2100010101111002 is an apocalyptic number.
100010101111002 is an abundant number, since it is smaller than the sum of its proper divisors (135156482287398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010101111002 is a wasteful number, since it uses less digits than its factorization.
100010101111002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510344368 (or 510344362 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100010101111002 its reverse (200111101010001), we get a palindrome (300121202121003).
The spelling of 100010101111002 in words is "one hundred trillion, ten billion, one hundred one million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •