Base | Representation |
---|---|
bin | 10110111101111010110001… |
… | …101001000110111110001101 |
3 | 111020122122200102202202011120 |
4 | 112331322301221012332031 |
5 | 101214440104412223041 |
6 | 554500140521311153 |
7 | 30163610023406604 |
oct | 2675726151067615 |
9 | 436578612682146 |
10 | 101012021211021 |
11 | 2a204a59660908 |
12 | b3b49816354b9 |
13 | 4449514a919ab |
14 | 1ad30179d8a3b |
15 | ba284b596366 |
hex | 5bdeb1a46f8d |
101012021211021 has 12 divisors (see below), whose sum is σ = 137004143309472. Its totient is φ = 66199968696424.
The previous prime is 101012021210957. The next prime is 101012021211037. The reversal of 101012021211021 is 120112120210101.
It is a happy number.
It is not a de Polignac number, because 101012021211021 - 26 = 101012021210957 is a prime.
It is a super-2 number, since 2×1010120212110212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101012021211041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4836340281 + ... + 4836361166.
It is an arithmetic number, because the mean of its divisors is an integer number (11417011942456).
Almost surely, 2101012021211021 is an apocalyptic number.
It is an amenable number.
101012021211021 is a deficient number, since it is larger than the sum of its proper divisors (35992122098451).
101012021211021 is an frugal number, since it uses more digits than its factorization.
101012021211021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9672701568 (or 9672701509 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101012021211021 its reverse (120112120210101), we get a palindrome (221124141421122).
The spelling of 101012021211021 in words is "one hundred one trillion, twelve billion, twenty-one million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •