Base | Representation |
---|---|
bin | 10111000011111000100110… |
… | …011110101010101010010101 |
3 | 111022002211220210101211101010 |
4 | 113003320212132222222111 |
5 | 101243144230321113023 |
6 | 555412343004322433 |
7 | 30235332534600033 |
oct | 2703704636525225 |
9 | 438084823354333 |
10 | 101422003301013 |
11 | 2a35291488515a |
12 | b46031b843419 |
13 | 4479091489455 |
14 | 1b08bcb7bb553 |
15 | bad3444b1093 |
hex | 5c3e267aaa95 |
101422003301013 has 4 divisors (see below), whose sum is σ = 135229337734688. Its totient is φ = 67614668867340.
The previous prime is 101422003300991. The next prime is 101422003301141. The reversal of 101422003301013 is 310103300224101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 101422003301013 - 213 = 101422003292821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101422003301413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16903667216833 + ... + 16903667216838.
It is an arithmetic number, because the mean of its divisors is an integer number (33807334433672).
Almost surely, 2101422003301013 is an apocalyptic number.
It is an amenable number.
101422003301013 is a deficient number, since it is larger than the sum of its proper divisors (33807334433675).
101422003301013 is an equidigital number, since it uses as much as digits as its factorization.
101422003301013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33807334433674.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101422003301013 its reverse (310103300224101), we get a palindrome (411525303525114).
The spelling of 101422003301013 in words is "one hundred one trillion, four hundred twenty-two billion, three million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •