Base | Representation |
---|---|
bin | 10100101011101101011… |
… | …100000000011110011011 |
3 | 12000212200102111201101211 |
4 | 110223231130000132123 |
5 | 141241332110443401 |
6 | 3004540251123551 |
7 | 204454463015344 |
oct | 24535534003633 |
9 | 5025612451354 |
10 | 1421322749851 |
11 | 4a8863702904 |
12 | 1ab5661435b7 |
13 | a4051353714 |
14 | 4cb144550cb |
15 | 26e8a0b1951 |
hex | 14aed70079b |
1421322749851 has 2 divisors, whose sum is σ = 1421322749852. Its totient is φ = 1421322749850.
The previous prime is 1421322749807. The next prime is 1421322749857. The reversal of 1421322749851 is 1589472231241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1421322749851 - 215 = 1421322717083 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1421322749795 and 1421322749804.
It is not a weakly prime, because it can be changed into another prime (1421322749857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 710661374925 + 710661374926.
It is an arithmetic number, because the mean of its divisors is an integer number (710661374926).
Almost surely, 21421322749851 is an apocalyptic number.
1421322749851 is a deficient number, since it is larger than the sum of its proper divisors (1).
1421322749851 is an equidigital number, since it uses as much as digits as its factorization.
1421322749851 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 967680, while the sum is 49.
The spelling of 1421322749851 in words is "one trillion, four hundred twenty-one billion, three hundred twenty-two million, seven hundred forty-nine thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •