Base | Representation |
---|---|
bin | 101010011000100… |
… | …0001010100100101 |
3 | 10200010000000200102 |
4 | 1110301001110211 |
5 | 10403031332423 |
6 | 353041153445 |
7 | 50145650612 |
oct | 12461012445 |
9 | 3603000612 |
10 | 1422136613 |
11 | 66a839317 |
12 | 33832b885 |
13 | 19882c571 |
14 | d6c35509 |
15 | 84cb8c28 |
hex | 54c41525 |
1422136613 has 4 divisors (see below), whose sum is σ = 1428401760. Its totient is φ = 1415871468.
The previous prime is 1422136601. The next prime is 1422136627. The reversal of 1422136613 is 3166312241.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1422136613 is a prime.
It is a super-2 number, since 2×14221366132 = 4044945092070223538, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1422136663) 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, 3132233 + ... + 3132686.
It is an arithmetic number, because the mean of its divisors is an integer number (357100440).
Almost surely, 21422136613 is an apocalyptic number.
It is an amenable number.
1422136613 is a deficient number, since it is larger than the sum of its proper divisors (6265147).
1422136613 is an equidigital number, since it uses as much as digits as its factorization.
1422136613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6265146.
The product of its digits is 5184, while the sum is 29.
The square root of 1422136613 is about 37711.2266175472. The cubic root of 1422136613 is about 1124.5543223617.
Adding to 1422136613 its reverse (3166312241), we get a palindrome (4588448854).
The spelling of 1422136613 in words is "one billion, four hundred twenty-two million, one hundred thirty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •