Base | Representation |
---|---|
bin | 101110100100100100… |
… | …0000111001001100100 |
3 | 100120010221112211200200 |
4 | 1131021020013021210 |
5 | 3114310321023022 |
6 | 113540001110500 |
7 | 10140240263061 |
oct | 1351110071144 |
9 | 316127484620 |
10 | 100011111012 |
11 | 39461734a5a |
12 | 17471628430 |
13 | 957abccbc7 |
14 | 4baa713c68 |
15 | 29051d1bac |
hex | 1749207264 |
100011111012 has 36 divisors (see below), whose sum is σ = 253530267900. Its totient is φ = 33241511232.
The previous prime is 100011110989. The next prime is 100011111047. The reversal of 100011111012 is 210111110001.
It can be written as a sum of positive squares in 2 ways, for example, as 56636384256 + 43374726756 = 237984^2 + 208266^2 .
It is a tau number, because it is divible by the number of its divisors (36).
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 = 100011110985 and 100011111003.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3967503 + ... + 3992630.
Almost surely, 2100011111012 is an apocalyptic number.
100011111012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100011111012 is an abundant number, since it is smaller than the sum of its proper divisors (153519156888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100011111012 is a wasteful number, since it uses less digits than its factorization.
100011111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7960492 (or 7960487 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100011111012 its reverse (210111110001), we get a palindrome (310122221013).
The spelling of 100011111012 in words is "one hundred billion, eleven million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •