Base | Representation |
---|---|
bin | 10110111110000010010100… |
… | …011111111101111101001001 |
3 | 111020200102121000020010210021 |
4 | 112332002110133331331021 |
5 | 101220103202241210441 |
6 | 554504000430020441 |
7 | 30164314541643022 |
oct | 2676022437757511 |
9 | 436612530203707 |
10 | 101020122210121 |
11 | 2a208436442394 |
12 | b3b6462647721 |
13 | 444a20620829a |
14 | 1ad3585873c49 |
15 | ba2b728923d1 |
hex | 5be0947fdf49 |
101020122210121 has 12 divisors (see below), whose sum is σ = 107702835881472. Its totient is φ = 94572029255528.
The previous prime is 101020122210061. The next prime is 101020122210157. The reversal of 101020122210121 is 121012221020101.
It is not a de Polignac number, because 101020122210121 - 223 = 101020113821513 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101020122210095 and 101020122210104.
It is not an unprimeable number, because it can be changed into a prime (101020122211121) 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, 994104745 + ... + 994206358.
It is an arithmetic number, because the mean of its divisors is an integer number (8975236323456).
Almost surely, 2101020122210121 is an apocalyptic number.
It is an amenable number.
101020122210121 is a deficient number, since it is larger than the sum of its proper divisors (6682713671351).
101020122210121 is an equidigital number, since it uses as much as digits as its factorization.
101020122210121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1988311220 (or 1988311173 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101020122210121 its reverse (121012221020101), we get a palindrome (222032343230222).
The spelling of 101020122210121 in words is "one hundred one trillion, twenty billion, one hundred twenty-two million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •