Base | Representation |
---|---|
bin | 10110110000101001011110… |
… | …111010001000111110101010 |
3 | 111010102110212002022110221012 |
4 | 112300221132322020332222 |
5 | 101110020001111200020 |
6 | 552521203503143522 |
7 | 30040664540020433 |
oct | 2660513672107652 |
9 | 433373762273835 |
10 | 100100100100010 |
11 | 299932399a195a |
12 | b2880a0ba4ba2 |
13 | 43b152560285a |
14 | 1aa0c2928c48a |
15 | b88c776cd7c5 |
hex | 5b0a5ee88faa |
100100100100010 has 32 divisors (see below), whose sum is σ = 184256884650240. Its totient is φ = 39136356487872.
The previous prime is 100100100099973. The next prime is 100100100100051. The reversal of 100100100100010 is 10001001001001.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a junction number, because it is equal to n+sod(n) for n = 100100100099967 and 100100100100003.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 140317220 + ... + 141028799.
It is an arithmetic number, because the mean of its divisors is an integer number (5758027645320).
Almost surely, 2100100100100010 is an apocalyptic number.
100100100100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100100100100010 is a deficient number, since it is larger than the sum of its proper divisors (84156784550230).
100100100100010 is a wasteful number, since it uses less digits than its factorization.
100100100100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281346830.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 100100100100010 its reverse (10001001001001), we get a palindrome (110101101101011).
Subtracting from 100100100100010 its reverse (10001001001001), we obtain a palindrome (90099099099009).
The spelling of 100100100100010 in words is "one hundred trillion, one hundred billion, one hundred million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •