Base | Representation |
---|---|
bin | 10110111110000010011001… |
… | …001100100100011101001110 |
3 | 111020200102210111111122022011 |
4 | 112332002121030210131032 |
5 | 101220103332424323042 |
6 | 554504012323011434 |
7 | 30164316516513166 |
oct | 2676023114443516 |
9 | 436612714448264 |
10 | 101020201011022 |
11 | 2a2084769746a7 |
12 | b3b6484b09b7a |
13 | 444a219638937 |
14 | 1ad35921075a6 |
15 | ba2b7975aa17 |
hex | 5be09932474e |
101020201011022 has 8 divisors (see below), whose sum is σ = 153606059071776. Its totient is φ = 49818181320432.
The previous prime is 101020201010999. The next prime is 101020201011109. The reversal of 101020201011022 is 220110102020101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 101020201010993 and 101020201011011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 345959592358 + ... + 345959592649.
It is an arithmetic number, because the mean of its divisors is an integer number (19200757383972).
Almost surely, 2101020201011022 is an apocalyptic number.
101020201011022 is a deficient number, since it is larger than the sum of its proper divisors (52585858060754).
101020201011022 is an equidigital number, since it uses as much as digits as its factorization.
101020201011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 691919185082.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101020201011022 its reverse (220110102020101), we get a palindrome (321130303031123).
The spelling of 101020201011022 in words is "one hundred one trillion, twenty billion, two hundred one million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •