Base | Representation |
---|---|
bin | 1110010100111001100… |
… | …10010010101101010101 |
3 | 1202001121012211101021122 |
4 | 13022130302102231111 |
5 | 31031120203420034 |
6 | 1014050053253325 |
7 | 50364402631364 |
oct | 7123462225525 |
9 | 1661535741248 |
10 | 492256701269 |
11 | 17a846090563 |
12 | 7b49b934245 |
13 | 3755bb555c8 |
14 | 19b7aa9b7db |
15 | cc10e4262e |
hex | 729cc92b55 |
492256701269 has 2 divisors, whose sum is σ = 492256701270. Its totient is φ = 492256701268.
The previous prime is 492256701239. The next prime is 492256701281. The reversal of 492256701269 is 962107652294.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 390343800625 + 101912900644 = 624775^2 + 319238^2 .
It is a cyclic number.
It is not a de Polignac number, because 492256701269 - 212 = 492256697173 is a prime.
It is a super-2 number, since 2×4922567012692 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 492256701269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (492256701239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 246128350634 + 246128350635.
It is an arithmetic number, because the mean of its divisors is an integer number (246128350635).
Almost surely, 2492256701269 is an apocalyptic number.
It is an amenable number.
492256701269 is a deficient number, since it is larger than the sum of its proper divisors (1).
492256701269 is an equidigital number, since it uses as much as digits as its factorization.
492256701269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3265920, while the sum is 53.
The spelling of 492256701269 in words is "four hundred ninety-two billion, two hundred fifty-six million, seven hundred one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •