Base | Representation |
---|---|
bin | 10110111110000011010000… |
… | …000110010101000101111101 |
3 | 111020200112011200201221011121 |
4 | 112332003100012111011331 |
5 | 101220112224230401414 |
6 | 554504243545350541 |
7 | 30164351403026230 |
oct | 2676032006250575 |
9 | 436615150657147 |
10 | 101021122122109 |
11 | 2a2088a9906032 |
12 | b3b66a1498451 |
13 | 444a335414397 |
14 | 1ad363c59b417 |
15 | ba2bd0557724 |
hex | 5be0d019517d |
101021122122109 has 16 divisors (see below), whose sum is σ = 115725085630848. Its totient is φ = 86385316937472.
The previous prime is 101021122122101. The next prime is 101021122122133. The reversal of 101021122122109 is 901221221120101.
It is not a de Polignac number, because 101021122122109 - 23 = 101021122122101 is a prime.
It is a super-2 number, since 2×1010211221221092 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101021122122101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16077297 + ... + 21459769.
It is an arithmetic number, because the mean of its divisors is an integer number (7232817851928).
Almost surely, 2101021122122109 is an apocalyptic number.
It is an amenable number.
101021122122109 is a deficient number, since it is larger than the sum of its proper divisors (14703963508739).
101021122122109 is an equidigital number, since it uses as much as digits as its factorization.
101021122122109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5388804.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 101021122122109 in words is "one hundred one trillion, twenty-one billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •