Base | Representation |
---|---|
bin | 10110111110000010001101… |
… | …110100010110000000101110 |
3 | 111020200102022012021220201210 |
4 | 112332002031310112000232 |
5 | 101220102440042023042 |
6 | 554503541343215250 |
7 | 30164312011056342 |
oct | 2676021564260056 |
9 | 436612265256653 |
10 | 101020010111022 |
11 | 2a208389137702 |
12 | b3b6430ba7526 |
13 | 444a1b8c19662 |
14 | 1ad3574a13622 |
15 | ba2b67aeca9c |
hex | 5be08dd1602e |
101020010111022 has 64 divisors (see below), whose sum is σ = 209543766681600. Its totient is φ = 32428696930560.
The previous prime is 101020010110933. The next prime is 101020010111029. The reversal of 101020010111022 is 220111010020101.
It is a super-2 number, since 2×1010200101110222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101020010110989 and 101020010111007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101020010111029) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 606749247 + ... + 606915717.
It is an arithmetic number, because the mean of its divisors is an integer number (3274121354400).
Almost surely, 2101020010111022 is an apocalyptic number.
101020010111022 is an abundant number, since it is smaller than the sum of its proper divisors (108523756570578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020010111022 is a wasteful number, since it uses less digits than its factorization.
101020010111022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175441.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101020010111022 its reverse (220111010020101), we get a palindrome (321131020131123).
The spelling of 101020010111022 in words is "one hundred one trillion, twenty billion, ten million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •