Base | Representation |
---|---|
bin | 101110100111001111… |
… | …1000101111000011010 |
3 | 100120101012201202022000 |
4 | 1131032133011320122 |
5 | 3120001330134320 |
6 | 113552532141430 |
7 | 10142411432661 |
oct | 1351637057032 |
9 | 316335652260 |
10 | 100101021210 |
11 | 394a8464903 |
12 | 17497767876 |
13 | 959371ccc8 |
14 | 4bb8639dd8 |
15 | 290d041c90 |
hex | 174e7c5e1a |
100101021210 has 32 divisors (see below), whose sum is σ = 266936057280. Its totient is φ = 26693605584.
The previous prime is 100101021203. The next prime is 100101021211. The reversal of 100101021210 is 12120101001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100101021192 and 100101021201.
It is not an unprimeable number, because it can be changed into a prime (100101021211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 185371992 + ... + 185372531.
It is an arithmetic number, because the mean of its divisors is an integer number (8341751790).
Almost surely, 2100101021210 is an apocalyptic number.
100101021210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100101021210 is an abundant number, since it is smaller than the sum of its proper divisors (166835036070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100101021210 is a wasteful number, since it uses less digits than its factorization.
100101021210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370744539 (or 370744533 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100101021210 its reverse (12120101001), we get a palindrome (112221122211).
The spelling of 100101021210 in words is "one hundred billion, one hundred one million, twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •