Base | Representation |
---|---|
bin | 11010110101101010… |
… | …01100001100010101 |
3 | 1101012011200121202102 |
4 | 31122311030030111 |
5 | 214002122414101 |
6 | 10341434251445 |
7 | 1020030510254 |
oct | 153265141425 |
9 | 41164617672 |
10 | 14408794901 |
11 | 6124430966 |
12 | 2961586b85 |
13 | 148820c657 |
14 | 9a98ca79b |
15 | 594e8286b |
hex | 35ad4c315 |
14408794901 has 2 divisors, whose sum is σ = 14408794902. Its totient is φ = 14408794900.
The previous prime is 14408794877. The next prime is 14408794973. The reversal of 14408794901 is 10949780441.
14408794901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13617723025 + 791071876 = 116695^2 + 28126^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14408794901 is a prime.
It is a super-2 number, since 2×144087949012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14408794501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7204397450 + 7204397451.
It is an arithmetic number, because the mean of its divisors is an integer number (7204397451).
Almost surely, 214408794901 is an apocalyptic number.
It is an amenable number.
14408794901 is a deficient number, since it is larger than the sum of its proper divisors (1).
14408794901 is an equidigital number, since it uses as much as digits as its factorization.
14408794901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 47.
The spelling of 14408794901 in words is "fourteen billion, four hundred eight million, seven hundred ninety-four thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •