Base | Representation |
---|---|
bin | 101010000110001… |
… | …0010001101110001 |
3 | 10122102212202121212 |
4 | 1110030102031301 |
5 | 10343100201411 |
6 | 352054525505 |
7 | 50001051461 |
oct | 12414221561 |
9 | 3572782555 |
10 | 1412506481 |
11 | 665361031 |
12 | 335066895 |
13 | 19683a169 |
14 | d5849ba1 |
15 | 8401568b |
hex | 54312371 |
1412506481 has 2 divisors, whose sum is σ = 1412506482. Its totient is φ = 1412506480.
The previous prime is 1412506477. The next prime is 1412506483. The reversal of 1412506481 is 1846052141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 945255025 + 467251456 = 30745^2 + 21616^2 .
It is a cyclic number.
It is not a de Polignac number, because 1412506481 - 22 = 1412506477 is a prime.
It is a super-2 number, since 2×14125064812 = 3990349117734006722, which contains 22 as substring.
Together with 1412506483, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1412506483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 706253240 + 706253241.
It is an arithmetic number, because the mean of its divisors is an integer number (706253241).
Almost surely, 21412506481 is an apocalyptic number.
It is an amenable number.
1412506481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1412506481 is an equidigital number, since it uses as much as digits as its factorization.
1412506481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7680, while the sum is 32.
The square root of 1412506481 is about 37583.3271677748. The cubic root of 1412506481 is about 1122.0102293375.
The spelling of 1412506481 in words is "one billion, four hundred twelve million, five hundred six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •