Base | Representation |
---|---|
bin | 111101111000101001011… |
… | …001000111000100101101 |
3 | 120001112222211001001200212 |
4 | 331320221121013010231 |
5 | 1024134023242241334 |
6 | 13013400254432205 |
7 | 616151112113561 |
oct | 75705131070455 |
9 | 16045884031625 |
10 | 4252712071469 |
11 | 139a6241072a4 |
12 | 588254802665 |
13 | 24b04ba09734 |
14 | 109b920076a1 |
15 | 75951e40ece |
hex | 3de2964712d |
4252712071469 has 2 divisors, whose sum is σ = 4252712071470. Its totient is φ = 4252712071468.
The previous prime is 4252712071457. The next prime is 4252712071483. The reversal of 4252712071469 is 9641702172524.
4252712071469 is digitally balanced in base 3, 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., 3343273285444 + 909438786025 = 1828462^2 + 953645^2 .
It is a cyclic number.
It is not a de Polignac number, because 4252712071469 - 28 = 4252712071213 is a prime.
It is a super-2 number, since 2×42527120714692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4252712071409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2126356035734 + 2126356035735.
It is an arithmetic number, because the mean of its divisors is an integer number (2126356035735).
Almost surely, 24252712071469 is an apocalyptic number.
It is an amenable number.
4252712071469 is a deficient number, since it is larger than the sum of its proper divisors (1).
4252712071469 is an equidigital number, since it uses as much as digits as its factorization.
4252712071469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 4252712071469 in words is "four trillion, two hundred fifty-two billion, seven hundred twelve million, seventy-one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •