Base | Representation |
---|---|
bin | 10110111101110001100011… |
… | …011111011010010001101100 |
3 | 111020121201010102002202121020 |
4 | 112331301203133122101230 |
5 | 101214304320222024322 |
6 | 554451422230334140 |
7 | 30163106456426445 |
oct | 2675614337322154 |
9 | 436551112082536 |
10 | 101002120111212 |
11 | 2a200838756aa1 |
12 | b3b2a797ba350 |
13 | 44485c7721558 |
14 | 1ad2758a5c2cc |
15 | ba246c22205c |
hex | 5bdc637da46c |
101002120111212 has 24 divisors (see below), whose sum is σ = 239666047723200. Its totient is φ = 33096739923216.
The previous prime is 101002120111199. The next prime is 101002120111231. The reversal of 101002120111212 is 212111021200101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101002120111191 and 101002120111200.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71329180162 + ... + 71329181577.
It is an arithmetic number, because the mean of its divisors is an integer number (9986085321800).
Almost surely, 2101002120111212 is an apocalyptic number.
101002120111212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101002120111212 is an abundant number, since it is smaller than the sum of its proper divisors (138663927611988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002120111212 is a wasteful number, since it uses less digits than its factorization.
101002120111212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142658361805 (or 142658361803 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101002120111212 its reverse (212111021200101), we get a palindrome (313113141311313).
The spelling of 101002120111212 in words is "one hundred one trillion, two billion, one hundred twenty million, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •