Base | Representation |
---|---|
bin | 10110111101111010111100… |
… | …111001101101011000001011 |
3 | 111020122200011121012220121112 |
4 | 112331322330321231120023 |
5 | 101214441001242041021 |
6 | 554500211350200535 |
7 | 30163614506136422 |
oct | 2675727471553013 |
9 | 436580147186545 |
10 | 101012210112011 |
11 | 2a205046252a30 |
12 | b3b4a1495314b |
13 | 4449544c61123 |
14 | 1ad3034b2c2b9 |
15 | ba285ce5bd5b |
hex | 5bdebce6d60b |
101012210112011 has 32 divisors (see below), whose sum is σ = 111089634355200. Its totient is φ = 91086884380800.
The previous prime is 101012210112001. The next prime is 101012210112053. The reversal of 101012210112011 is 110211012210101.
It is a de Polignac number, because none of the positive numbers 2k-101012210112011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101012210112001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2459073605 + ... + 2459114681.
It is an arithmetic number, because the mean of its divisors is an integer number (3471551073600).
Almost surely, 2101012210112011 is an apocalyptic number.
101012210112011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101012210112011 is a deficient number, since it is larger than the sum of its proper divisors (10077424243189).
101012210112011 is a wasteful number, since it uses less digits than its factorization.
101012210112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44715.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101012210112011 its reverse (110211012210101), we get a palindrome (211223222322112).
The spelling of 101012210112011 in words is "one hundred one trillion, twelve billion, two hundred ten million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •