Base | Representation |
---|---|
bin | 1100010001010111001011… |
… | …1000000001001110110101 |
3 | 1202202212021220210012212111 |
4 | 3010111302320001032311 |
5 | 3232024433402030334 |
6 | 44410155412451021 |
7 | 2561536510005646 |
oct | 304256270011665 |
9 | 52685256705774 |
10 | 13492419564469 |
11 | 433211510883a |
12 | 161ab08019a71 |
13 | 76b439494781 |
14 | 3490725996cd |
15 | 185e7ea4a064 |
hex | c4572e013b5 |
13492419564469 has 2 divisors, whose sum is σ = 13492419564470. Its totient is φ = 13492419564468.
The previous prime is 13492419564467. The next prime is 13492419564493. The reversal of 13492419564469 is 96446591429431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10845495562500 + 2646924001969 = 3293250^2 + 1626937^2 .
It is a cyclic number.
It is not a de Polignac number, because 13492419564469 - 21 = 13492419564467 is a prime.
It is a super-2 number, since 2×134924195644692 (a number of 27 digits) contains 22 as substring.
Together with 13492419564467, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13492419564467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6746209782234 + 6746209782235.
It is an arithmetic number, because the mean of its divisors is an integer number (6746209782235).
Almost surely, 213492419564469 is an apocalyptic number.
It is an amenable number.
13492419564469 is a deficient number, since it is larger than the sum of its proper divisors (1).
13492419564469 is an equidigital number, since it uses as much as digits as its factorization.
13492419564469 is an evil number, because the sum of its binary digits is even.
The product of its digits is 201553920, while the sum is 67.
The spelling of 13492419564469 in words is "thirteen trillion, four hundred ninety-two billion, four hundred nineteen million, five hundred sixty-four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •