Base | Representation |
---|---|
bin | 101110100100100011… |
… | …1101100010101111100 |
3 | 100120010221100021002000 |
4 | 1131021013230111330 |
5 | 3114310304014322 |
6 | 113535554502300 |
7 | 10140236325003 |
oct | 1351107542574 |
9 | 316127307060 |
10 | 100011001212 |
11 | 3946166a511 |
12 | 17471594990 |
13 | 957ab91c35 |
14 | 4baa6c5c3a |
15 | 29051ae3ac |
hex | 17491ec57c |
100011001212 has 96 divisors (see below), whose sum is σ = 260654472960. Its totient is φ = 33161711040.
The previous prime is 100011001187. The next prime is 100011001213. The reversal of 100011001212 is 212100110001.
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 = 100011001194 and 100011001203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100011001213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19955787 + ... + 19960797.
It is an arithmetic number, because the mean of its divisors is an integer number (2715150760).
Almost surely, 2100011001212 is an apocalyptic number.
100011001212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100011001212 is an abundant number, since it is smaller than the sum of its proper divisors (160643471748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100011001212 is a wasteful number, since it uses less digits than its factorization.
100011001212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5960 (or 5952 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100011001212 its reverse (212100110001), we get a palindrome (312111111213).
The spelling of 100011001212 in words is "one hundred billion, eleven million, one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •