Base | Representation |
---|---|
bin | 100100100101111010111… |
… | …1110001011110101110101 |
3 | 122210210100021102120100201 |
4 | 1021023311332023311311 |
5 | 1124344340021040134 |
6 | 14410222242040501 |
7 | 1026231134351131 |
oct | 111136576136565 |
9 | 18723307376321 |
10 | 5029238455669 |
11 | 1669984aa600a |
12 | 692849949131 |
13 | 2a634174c0cc |
14 | 1355b89d63c1 |
15 | 8ac4e56c914 |
hex | 492f5f8bd75 |
5029238455669 has 2 divisors, whose sum is σ = 5029238455670. Its totient is φ = 5029238455668.
The previous prime is 5029238455651. The next prime is 5029238455699. The reversal of 5029238455669 is 9665548329205.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4763459026225 + 265779429444 = 2182535^2 + 515538^2 .
It is a cyclic number.
It is not a de Polignac number, because 5029238455669 - 27 = 5029238455541 is a prime.
It is a super-2 number, since 2×50292384556692 (a number of 26 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 5029238455669.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5029238455699) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2514619227834 + 2514619227835.
It is an arithmetic number, because the mean of its divisors is an integer number (2514619227835).
Almost surely, 25029238455669 is an apocalyptic number.
It is an amenable number.
5029238455669 is a deficient number, since it is larger than the sum of its proper divisors (1).
5029238455669 is an equidigital number, since it uses as much as digits as its factorization.
5029238455669 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 139968000, while the sum is 64.
The spelling of 5029238455669 in words is "five trillion, twenty-nine billion, two hundred thirty-eight million, four hundred fifty-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •