Base | Representation |
---|---|
bin | 10110111101111010110110… |
… | …011110000100001101100100 |
3 | 111020122122220002011112012022 |
4 | 112331322312132010031210 |
5 | 101214440241130432322 |
6 | 554500152533242312 |
7 | 30163612026001535 |
oct | 2675726636041544 |
9 | 436578802145168 |
10 | 101012102202212 |
11 | 2a204aa0349783 |
12 | b3b49a4793398 |
13 | 44495287ab286 |
14 | 1ad302467c68c |
15 | ba2853743942 |
hex | 5bdeb6784364 |
101012102202212 has 48 divisors (see below), whose sum is σ = 192320501104368. Its totient is φ = 46228146831360.
The previous prime is 101012102202199. The next prime is 101012102202269. The reversal of 101012102202212 is 212202201210101.
It can be written as a sum of positive squares in 8 ways, for example, as 8992285653796 + 92019816548416 = 2998714^2 + 9592696^2 .
It is a super-3 number, since 3×1010121022022123 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4410503 + ... + 14882094.
It is an arithmetic number, because the mean of its divisors is an integer number (4006677106341).
Almost surely, 2101012102202212 is an apocalyptic number.
It is an amenable number.
101012102202212 is a deficient number, since it is larger than the sum of its proper divisors (91308398902156).
101012102202212 is a wasteful number, since it uses less digits than its factorization.
101012102202212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19294736 (or 19294734 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101012102202212 its reverse (212202201210101), we get a palindrome (313214303412313).
The spelling of 101012102202212 in words is "one hundred one trillion, twelve billion, one hundred two million, two hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •