Base | Representation |
---|---|
bin | 101111000101000010… |
… | …1110010001101101100 |
3 | 100122221220101221202200 |
4 | 1132022011302031230 |
5 | 3124023330120022 |
6 | 114240053421500 |
7 | 10206243330246 |
oct | 1361205621554 |
9 | 318856357680 |
10 | 101101020012 |
11 | 399709877a3 |
12 | 1771663a890 |
13 | 96c2959785 |
14 | 4c71387096 |
15 | 296ac22bac |
hex | 178a17236c |
101101020012 has 36 divisors (see below), whose sum is σ = 256014890040. Its totient is φ = 33640474752.
The previous prime is 101101020011. The next prime is 101101020019. The reversal of 101101020012 is 210020101101.
It is a happy number.
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 = 101101019976 and 101101020003.
It is not an unprimeable number, because it can be changed into a prime (101101020011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2473837 + ... + 2514372.
Almost surely, 2101101020012 is an apocalyptic number.
101101020012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101101020012 is an abundant number, since it is smaller than the sum of its proper divisors (154913870028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101020012 is a wasteful number, since it uses less digits than its factorization.
101101020012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4988782 (or 4988777 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101101020012 its reverse (210020101101), we get a palindrome (311121121113).
The spelling of 101101020012 in words is "one hundred one billion, one hundred one million, twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •