Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …011111011000110000001110 |
3 | 111010002212112211102202221120 |
4 | 112233111222133120300032 |
5 | 101102031141111200420 |
6 | 552412001122541410 |
7 | 30031330340444244 |
oct | 2657255237306016 |
9 | 433085484382846 |
10 | 100010100100110 |
11 | 29959055280952 |
12 | b272764207866 |
13 | 43a5bb17b0645 |
14 | 1a9a72c390794 |
15 | b8675b351d40 |
hex | 5af56a7d8c0e |
100010100100110 has 16 divisors (see below), whose sum is σ = 240024240240336. Its totient is φ = 26669360026688.
The previous prime is 100010100100093. The next prime is 100010100100111. The reversal of 100010100100110 is 11001001010001.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100010100100111) 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, 1666835001639 + ... + 1666835001698.
It is an arithmetic number, because the mean of its divisors is an integer number (15001515015021).
Almost surely, 2100010100100110 is an apocalyptic number.
100010100100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100010100100110 is an abundant number, since it is smaller than the sum of its proper divisors (140014140140226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010100100110 is a wasteful number, since it uses less digits than its factorization.
100010100100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3333670003347.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 100010100100110 its reverse (11001001010001), we get a palindrome (111011101110111).
The spelling of 100010100100110 in words is "one hundred trillion, ten billion, one hundred million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •