Base | Representation |
---|---|
bin | 10011011110110011011… |
… | …01011010001000001101 |
3 | 2100222202201102200211002 |
4 | 21233121231122020031 |
5 | 41431333324142003 |
6 | 1231301103310045 |
7 | 66234450201125 |
oct | 11573155321015 |
9 | 2328681380732 |
10 | 669372490253 |
11 | 238974358275 |
12 | a988b5ab325 |
13 | 4b1770968cc |
14 | 2457d7d1c85 |
15 | 1262a329a88 |
hex | 9bd9b5a20d |
669372490253 has 2 divisors, whose sum is σ = 669372490254. Its totient is φ = 669372490252.
The previous prime is 669372490169. The next prime is 669372490277. The reversal of 669372490253 is 352094273966.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 421769715844 + 247602774409 = 649438^2 + 497597^2 .
It is a cyclic number.
It is not a de Polignac number, because 669372490253 - 210 = 669372489229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (669372490153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 334686245126 + 334686245127.
It is an arithmetic number, because the mean of its divisors is an integer number (334686245127).
Almost surely, 2669372490253 is an apocalyptic number.
It is an amenable number.
669372490253 is a deficient number, since it is larger than the sum of its proper divisors (1).
669372490253 is an equidigital number, since it uses as much as digits as its factorization.
669372490253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14696640, while the sum is 56.
The spelling of 669372490253 in words is "six hundred sixty-nine billion, three hundred seventy-two million, four hundred ninety thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •