Base | Representation |
---|---|
bin | 10100101100010110000… |
… | …000100110011010111101 |
3 | 12000221102212022220112111 |
4 | 110230112000212122331 |
5 | 141244230334243401 |
6 | 3005132004334021 |
7 | 204510366505651 |
oct | 24542600463275 |
9 | 5027385286474 |
10 | 1422003431101 |
11 | 4a90829577a0 |
12 | 1ab7160a4311 |
13 | a412c38a7a6 |
14 | 4cb7aa00a61 |
15 | 26ec9c19e51 |
hex | 14b160266bd |
1422003431101 has 16 divisors (see below), whose sum is σ = 1673519133888. Its totient is φ = 1193731052800.
The previous prime is 1422003431099. The next prime is 1422003431141. The reversal of 1422003431101 is 1011343002241.
It is not a de Polignac number, because 1422003431101 - 21 = 1422003431099 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 (1422003431141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71728735 + ... + 71748556.
It is an arithmetic number, because the mean of its divisors is an integer number (104594945868).
Almost surely, 21422003431101 is an apocalyptic number.
1422003431101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1422003431101 is a deficient number, since it is larger than the sum of its proper divisors (251515702787).
1422003431101 is a wasteful number, since it uses less digits than its factorization.
1422003431101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143477372.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1422003431101 its reverse (1011343002241), we get a palindrome (2433346433342).
The spelling of 1422003431101 in words is "one trillion, four hundred twenty-two billion, three million, four hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •