Base | Representation |
---|---|
bin | 101010001110101… |
… | …0100100111100001 |
3 | 10122202021200012221 |
4 | 1110131110213201 |
5 | 10400221112034 |
6 | 352334351041 |
7 | 50054032642 |
oct | 12435244741 |
9 | 3582250187 |
10 | 1416972769 |
11 | 667931683 |
12 | 33665b481 |
13 | 197742034 |
14 | d628d6c9 |
15 | 845e8bb4 |
hex | 547549e1 |
1416972769 has 4 divisors (see below), whose sum is σ = 1462681600. Its totient is φ = 1371263940.
The previous prime is 1416972761. The next prime is 1416972787. The reversal of 1416972769 is 9672796141.
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, and also an emirpimes, since its reverse is a distinct semiprime: 9672796141 = 109 ⋅88741249.
It is a cyclic number.
It is not a de Polignac number, because 1416972769 - 23 = 1416972761 is a prime.
It is a super-2 number, since 2×14169727692 = 4015623656175054722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1416972761) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22854369 + ... + 22854430.
It is an arithmetic number, because the mean of its divisors is an integer number (365670400).
Almost surely, 21416972769 is an apocalyptic number.
It is an amenable number.
1416972769 is a deficient number, since it is larger than the sum of its proper divisors (45708831).
1416972769 is an equidigital number, since it uses as much as digits as its factorization.
1416972769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45708830.
The product of its digits is 1143072, while the sum is 52.
The square root of 1416972769 is about 37642.6987475659. The cubic root of 1416972769 is about 1123.1915686541.
The spelling of 1416972769 in words is "one billion, four hundred sixteen million, nine hundred seventy-two thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •