Base | Representation |
---|---|
bin | 11011001011010001… |
… | …00111101000000001 |
3 | 1101122210202021022122 |
4 | 31211220213220001 |
5 | 214340023030034 |
6 | 10411431214025 |
7 | 1024361240222 |
oct | 154550475001 |
9 | 41583667278 |
10 | 14590048769 |
11 | 620777a64a |
12 | 29b2217315 |
13 | 14b693216a |
14 | 9c59cd249 |
15 | 5a5d3762e |
hex | 365a27a01 |
14590048769 has 2 divisors, whose sum is σ = 14590048770. Its totient is φ = 14590048768.
The previous prime is 14590048721. The next prime is 14590048801. The reversal of 14590048769 is 96784009541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14517117169 + 72931600 = 120487^2 + 8540^2 .
It is a cyclic number.
It is not a de Polignac number, because 14590048769 - 28 = 14590048513 is a prime.
It is a super-2 number, since 2×145900487692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14590048769.
It is not a weakly prime, because it can be changed into another prime (14590048709) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7295024384 + 7295024385.
It is an arithmetic number, because the mean of its divisors is an integer number (7295024385).
Almost surely, 214590048769 is an apocalyptic number.
It is an amenable number.
14590048769 is a deficient number, since it is larger than the sum of its proper divisors (1).
14590048769 is an equidigital number, since it uses as much as digits as its factorization.
14590048769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 53.
The spelling of 14590048769 in words is "fourteen billion, five hundred ninety million, forty-eight thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •