Base | Representation |
---|---|
bin | 101010001100111… |
… | …0011111011010111 |
3 | 10122200112220202122 |
4 | 1110121303323113 |
5 | 10400002134224 |
6 | 352302530155 |
7 | 50043150524 |
oct | 12431637327 |
9 | 3580486678 |
10 | 1416052439 |
11 | 66736317a |
12 | 33629695b |
13 | 1974ac169 |
14 | d60d014b |
15 | 844b615e |
hex | 54673ed7 |
1416052439 has 4 divisors (see below), whose sum is σ = 1422763800. Its totient is φ = 1409341080.
The previous prime is 1416052433. The next prime is 1416052483. The reversal of 1416052439 is 9342506141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9342506141 = 29251 ⋅319391.
It is a cyclic number.
It is not a de Polignac number, because 1416052439 - 24 = 1416052423 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1416052399 and 1416052408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1416052433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3355364 + ... + 3355785.
It is an arithmetic number, because the mean of its divisors is an integer number (355690950).
Almost surely, 21416052439 is an apocalyptic number.
1416052439 is a deficient number, since it is larger than the sum of its proper divisors (6711361).
1416052439 is an equidigital number, since it uses as much as digits as its factorization.
1416052439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6711360.
The product of its (nonzero) digits is 25920, while the sum is 35.
The square root of 1416052439 is about 37630.4722133539. The cubic root of 1416052439 is about 1122.9483433786.
The spelling of 1416052439 in words is "one billion, four hundred sixteen million, fifty-two thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •