Base | Representation |
---|---|
bin | 101011110001111… |
… | …1110100010110101 |
3 | 10210101021102101201 |
4 | 1113203332202311 |
5 | 11002034032023 |
6 | 401434452501 |
7 | 51255465505 |
oct | 12743764265 |
9 | 3711242351 |
10 | 1469049013 |
11 | 6942702a3 |
12 | 34bb94131 |
13 | 1a5476493 |
14 | dd167a05 |
15 | 88e83bad |
hex | 578fe8b5 |
1469049013 has 2 divisors, whose sum is σ = 1469049014. Its totient is φ = 1469049012.
The previous prime is 1469048993. The next prime is 1469049019. The reversal of 1469049013 is 3109409641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1271421649 + 197627364 = 35657^2 + 14058^2 .
It is a cyclic number.
It is not a de Polignac number, because 1469049013 - 29 = 1469048501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1469049019) 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 as a sum of consecutive naturals, namely, 734524506 + 734524507.
It is an arithmetic number, because the mean of its divisors is an integer number (734524507).
Almost surely, 21469049013 is an apocalyptic number.
It is an amenable number.
1469049013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1469049013 is an equidigital number, since it uses as much as digits as its factorization.
1469049013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 37.
The square root of 1469049013 is about 38328.1751848428. The cubic root of 1469049013 is about 1136.7861190394.
The spelling of 1469049013 in words is "one billion, four hundred sixty-nine million, forty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •