Base | Representation |
---|---|
bin | 10111000011111000110010… |
… | …001101001000100011000111 |
3 | 111022002212102111120202202220 |
4 | 113003320302031020203013 |
5 | 101243200131202001211 |
6 | 555412414313103423 |
7 | 30235340444016066 |
oct | 2703706215104307 |
9 | 438085374522686 |
10 | 101422200031431 |
11 | 2a352a05934684 |
12 | b4603756b7b73 |
13 | 44790c316a496 |
14 | 1b08c0998c1dd |
15 | bad3568c1806 |
hex | 5c3e323488c7 |
101422200031431 has 8 divisors (see below), whose sum is σ = 136568506973424. Its totient is φ = 66945346555200.
The previous prime is 101422200031381. The next prime is 101422200031447. The reversal of 101422200031431 is 134130002224101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101422200031431 - 213 = 101422200023239 is a prime.
It is a super-2 number, since 2×1014222000314312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101422200032431) 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, 167363366086 + ... + 167363366691.
It is an arithmetic number, because the mean of its divisors is an integer number (17071063371678).
Almost surely, 2101422200031431 is an apocalyptic number.
101422200031431 is a deficient number, since it is larger than the sum of its proper divisors (35146306941993).
101422200031431 is a wasteful number, since it uses less digits than its factorization.
101422200031431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 334726732881.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 101422200031431 its reverse (134130002224101), we get a palindrome (235552202255532).
The spelling of 101422200031431 in words is "one hundred one trillion, four hundred twenty-two billion, two hundred million, thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •