Base | Representation |
---|---|
bin | 101110100111001110… |
… | …0000010110000111010 |
3 | 100120101011020011000000 |
4 | 1131032130002300322 |
5 | 3120001124101020 |
6 | 113552503053430 |
7 | 10142401563645 |
oct | 1351634026072 |
9 | 316334204000 |
10 | 100100222010 |
11 | 394a7a69408 |
12 | 17497441276 |
13 | 95935002c9 |
14 | 4bb84aca5c |
15 | 290ce35090 |
hex | 174e702c3a |
100100222010 has 56 divisors (see below), whose sum is σ = 270147038580. Its totient is φ = 26693390592.
The previous prime is 100100221999. The next prime is 100100222011. The reversal of 100100222010 is 10222001001.
It can be written as a sum of positive squares in 2 ways, for example, as 97233583329 + 2866638681 = 311823^2 + 53541^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100100221983 and 100100222001.
It is not an unprimeable number, because it can be changed into a prime (100100222011) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 6858295 + ... + 6872874.
Almost surely, 2100100222010 is an apocalyptic number.
100100222010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100100222010 is an abundant number, since it is smaller than the sum of its proper divisors (170046816570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100100222010 is an equidigital number, since it uses as much as digits as its factorization.
100100222010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13731194 (or 13731179 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 100100222010 its reverse (10222001001), we get a palindrome (110322223011).
The spelling of 100100222010 in words is "one hundred billion, one hundred million, two hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •