Base | Representation |
---|---|
bin | 101010011001100… |
… | …1110010111101001 |
3 | 10200011002101011220 |
4 | 1110303032113221 |
5 | 10403203324340 |
6 | 353101412253 |
7 | 50153605143 |
oct | 12463162751 |
9 | 3604071156 |
10 | 1422714345 |
11 | 6700a3388 |
12 | 33856a089 |
13 | 1989a2510 |
14 | d6d45c93 |
15 | 84d7eed0 |
hex | 54cce5e9 |
1422714345 has 32 divisors (see below), whose sum is σ = 2469129600. Its totient is φ = 695361024.
The previous prime is 1422714331. The next prime is 1422714347. The reversal of 1422714345 is 5434172241.
It is not a de Polignac number, because 1422714345 - 24 = 1422714329 is a prime.
It is a super-2 number, since 2×14227143452 = 4048232214937558050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1422714347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 861 + ... + 53349.
It is an arithmetic number, because the mean of its divisors is an integer number (77160300).
Almost surely, 21422714345 is an apocalyptic number.
1422714345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1422714345 is a deficient number, since it is larger than the sum of its proper divisors (1046415255).
1422714345 is a wasteful number, since it uses less digits than its factorization.
1422714345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52649.
The product of its digits is 26880, while the sum is 33.
The square root of 1422714345 is about 37718.8857868310. The cubic root of 1422714345 is about 1124.7065822441.
Adding to 1422714345 its reverse (5434172241), we get a palindrome (6856886586).
The spelling of 1422714345 in words is "one billion, four hundred twenty-two million, seven hundred fourteen thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.235 sec. • engine limits •