Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …110101100111111110000101 |
3 | 111020200102120020100012022110 |
4 | 112332002103311213332011 |
5 | 101220103141421010041 |
6 | 554503555352051233 |
7 | 30164314345412145 |
oct | 2676022365477605 |
9 | 436612506305273 |
10 | 101020111110021 |
11 | 2a208430150754 |
12 | b3b645a993b19 |
13 | 444a203b1ca8c |
14 | 1ad35841c4925 |
15 | ba2b718ed516 |
hex | 5be093d67f85 |
101020111110021 has 16 divisors (see below), whose sum is σ = 142685686059200. Its totient is φ = 63395792149248.
The previous prime is 101020111110019. The next prime is 101020111110029. The reversal of 101020111110021 is 120011111020101.
It is not a de Polignac number, because 101020111110021 - 21 = 101020111110019 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101020111109979 and 101020111110006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101020111110029) 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, 5644203316 + ... + 5644221213.
It is an arithmetic number, because the mean of its divisors is an integer number (8917855378700).
Almost surely, 2101020111110021 is an apocalyptic number.
It is an amenable number.
101020111110021 is a deficient number, since it is larger than the sum of its proper divisors (41665574949179).
101020111110021 is a wasteful number, since it uses less digits than its factorization.
101020111110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11288424708.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101020111110021 its reverse (120011111020101), we get a palindrome (221031222130122).
The spelling of 101020111110021 in words is "one hundred one trillion, twenty billion, one hundred eleven million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •