Base | Representation |
---|---|
bin | 10111000000110100000110… |
… | …010110111111010011110101 |
3 | 111021100200022101012102010111 |
4 | 113000310012112333103311 |
5 | 101231220122310120041 |
6 | 555131410243423021 |
7 | 30214153130026420 |
oct | 2700640626772365 |
9 | 437320271172114 |
10 | 101211011020021 |
11 | 2a281392178611 |
12 | b427456984a71 |
13 | 4462207a161c6 |
14 | 1adc8d38789b7 |
15 | ba7ae5ec4981 |
hex | 5c0d065bf4f5 |
101211011020021 has 16 divisors (see below), whose sum is σ = 116127940371840. Its totient is φ = 86409173283840.
The previous prime is 101211011019983. The next prime is 101211011020039. The reversal of 101211011020021 is 120020110112101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101211011020021 - 221 = 101211008922869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101211011019983 and 101211011020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101211011020081) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20169600 + ... + 24682681.
It is an arithmetic number, because the mean of its divisors is an integer number (7257996273240).
Almost surely, 2101211011020021 is an apocalyptic number.
It is an amenable number.
101211011020021 is a deficient number, since it is larger than the sum of its proper divisors (14916929351819).
101211011020021 is an equidigital number, since it uses as much as digits as its factorization.
101211011020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44853564.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101211011020021 its reverse (120020110112101), we get a palindrome (221231121132122).
The spelling of 101211011020021 in words is "one hundred one trillion, two hundred eleven billion, eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •