Base | Representation |
---|---|
bin | 101111000010000100… |
… | …0001111100011111100 |
3 | 100122200221012110202200 |
4 | 1132010020033203330 |
5 | 3123322224014322 |
6 | 114222121551500 |
7 | 10203620226246 |
oct | 1360410174374 |
9 | 318627173680 |
10 | 101001001212 |
11 | 3991a483131 |
12 | 176a9045590 |
13 | 96a800a557 |
14 | 4c61d8d096 |
15 | 29620678ac |
hex | 178420f8fc |
101001001212 has 36 divisors (see below), whose sum is σ = 257144847960. Its totient is φ = 33424790112.
The previous prime is 101001001201. The next prime is 101001001219. The reversal of 101001001212 is 212100100101.
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 = 101001001194 and 101001001203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001001219) 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, 10087023 + ... + 10097030.
Almost surely, 2101001001212 is an apocalyptic number.
101001001212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101001001212 is an abundant number, since it is smaller than the sum of its proper divisors (156143846748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001001212 is a wasteful number, since it uses less digits than its factorization.
101001001212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20184202 (or 20184197 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101001001212 its reverse (212100100101), we get a palindrome (313101101313).
The spelling of 101001001212 in words is "one hundred one billion, one million, one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •