Base | Representation |
---|---|
bin | 101010000110010… |
… | …1010011000101001 |
3 | 10122110001210102112 |
4 | 1110030222120221 |
5 | 10343111333411 |
6 | 352101012105 |
7 | 50001643220 |
oct | 12414523051 |
9 | 3573053375 |
10 | 1412605481 |
11 | 665419451 |
12 | 3350b4035 |
13 | 196873241 |
14 | d5873cb7 |
15 | 84034b8b |
hex | 5432a629 |
1412605481 has 4 divisors (see below), whose sum is σ = 1614406272. Its totient is φ = 1210804692.
The previous prime is 1412605409. The next prime is 1412605541. The reversal of 1412605481 is 1845062141.
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-1412605481 is a prime.
It is a super-2 number, since 2×14126054812 = 3990908489902482722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1412605681) 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 in 3 ways as a sum of consecutive naturals, for example, 100900385 + ... + 100900398.
It is an arithmetic number, because the mean of its divisors is an integer number (403601568).
Almost surely, 21412605481 is an apocalyptic number.
It is an amenable number.
1412605481 is a deficient number, since it is larger than the sum of its proper divisors (201800791).
1412605481 is an equidigital number, since it uses as much as digits as its factorization.
1412605481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201800790.
The product of its (nonzero) digits is 7680, while the sum is 32.
The square root of 1412605481 is about 37584.6442180846. The cubic root of 1412605481 is about 1122.0364419411.
The spelling of 1412605481 in words is "one billion, four hundred twelve million, six hundred five thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •