Base | Representation |
---|---|
bin | 10110111101110000101101… |
… | …010111101010110011101001 |
3 | 111020121121210010112121222200 |
4 | 112331300231113222303221 |
5 | 101214300440300041410 |
6 | 554451152153010413 |
7 | 30163045122523644 |
oct | 2675605527526351 |
9 | 436547703477880 |
10 | 101001212112105 |
11 | 2a200412160908 |
12 | b3b28656b3a09 |
13 | 44484b1586c86 |
14 | 1ad26b021ca5b |
15 | ba24176653c0 |
hex | 5bdc2d5eace9 |
101001212112105 has 48 divisors (see below), whose sum is σ = 176035110451200. Its totient is φ = 53570136355200.
The previous prime is 101001212112061. The next prime is 101001212112139. The reversal of 101001212112105 is 501211212100101.
It is a happy number.
It is not a de Polignac number, because 101001212112105 - 222 = 101001207917801 is a prime.
It is a super-2 number, since 2×1010012121121052 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 28775596 + ... + 32094194.
It is an arithmetic number, because the mean of its divisors is an integer number (3667398134400).
Almost surely, 2101001212112105 is an apocalyptic number.
101001212112105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101001212112105 is a deficient number, since it is larger than the sum of its proper divisors (75033898339095).
101001212112105 is a wasteful number, since it uses less digits than its factorization.
101001212112105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3322342 (or 3322339 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 18.
Adding to 101001212112105 its reverse (501211212100101), we get a palindrome (602212424212206).
The spelling of 101001212112105 in words is "one hundred one trillion, one billion, two hundred twelve million, one hundred twelve thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •