Base | Representation |
---|---|
bin | 10110111110000010001110… |
… | …100010110110000111001011 |
3 | 111020200102100001020020102022 |
4 | 112332002032202312013023 |
5 | 101220103001202114011 |
6 | 554503542500355055 |
7 | 30164312216510123 |
oct | 2676021642660713 |
9 | 436612301206368 |
10 | 101020022301131 |
11 | 2a20839500327a |
12 | b3b64350a5a8b |
13 | 444a1bb5c703b |
14 | 1ad35764a7c83 |
15 | ba2b68c098db |
hex | 5be08e8b61cb |
101020022301131 has 8 divisors (see below), whose sum is σ = 101027752924800. Its totient is φ = 101012291997120.
The previous prime is 101020022301113. The next prime is 101020022301151. The reversal of 101020022301131 is 131103220020101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101020022301131 - 234 = 101002842431947 is a prime.
It is a super-2 number, since 2×1010200223011312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101020022301151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1431066185 + ... + 1431136773.
It is an arithmetic number, because the mean of its divisors is an integer number (12628469115600).
Almost surely, 2101020022301131 is an apocalyptic number.
101020022301131 is a deficient number, since it is larger than the sum of its proper divisors (7730623669).
101020022301131 is an equidigital number, since it uses as much as digits as its factorization.
101020022301131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159829.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101020022301131 its reverse (131103220020101), we get a palindrome (232123242321232).
The spelling of 101020022301131 in words is "one hundred one trillion, twenty billion, twenty-two million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •