Base | Representation |
---|---|
bin | 101010011000011… |
… | …1101100100101001 |
3 | 10200002222020121200 |
4 | 1110300331210221 |
5 | 10403030340012 |
6 | 353040554413 |
7 | 50145555054 |
oct | 12460754451 |
9 | 3602866550 |
10 | 1422121257 |
11 | 66a828827 |
12 | 338322a09 |
13 | 19882558b |
14 | d6c2da9b |
15 | 84cb43dc |
hex | 54c3d929 |
1422121257 has 12 divisors (see below), whose sum is σ = 2143487424. Its totient is φ = 906859800.
The previous prime is 1422121231. The next prime is 1422121277. The reversal of 1422121257 is 7521212241.
It is a happy number.
It is not a de Polignac number, because 1422121257 - 26 = 1422121193 is a prime.
It is a super-2 number, since 2×14221212572 = 4044857739222520098, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1422121257.
It is not an unprimeable number, because it can be changed into a prime (1422121277) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3434869 + ... + 3435282.
It is an arithmetic number, because the mean of its divisors is an integer number (178623952).
Almost surely, 21422121257 is an apocalyptic number.
It is an amenable number.
1422121257 is a deficient number, since it is larger than the sum of its proper divisors (721366167).
1422121257 is a wasteful number, since it uses less digits than its factorization.
1422121257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6870180 (or 6870177 counting only the distinct ones).
The product of its digits is 2240, while the sum is 27.
The square root of 1422121257 is about 37711.0230171498. The cubic root of 1422121257 is about 1124.5502747622.
Adding to 1422121257 its reverse (7521212241), we get a palindrome (8943333498).
The spelling of 1422121257 in words is "one billion, four hundred twenty-two million, one hundred twenty-one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •