Base | Representation |
---|---|
bin | 1100001111111111111100… |
… | …0110011101011111010001 |
3 | 1202200121211221011210210122 |
4 | 3003333333012131133101 |
5 | 3231134004100403224 |
6 | 44351324012440025 |
7 | 2560050302015105 |
oct | 303777706353721 |
9 | 52617757153718 |
10 | 13469002356689 |
11 | 432319876aa60 |
12 | 1616471779015 |
13 | 769176b4a7c9 |
14 | 347c90507905 |
15 | 18555dcc815e |
hex | c3fff19d7d1 |
13469002356689 has 4 divisors (see below), whose sum is σ = 14693457116400. Its totient is φ = 12244547596980.
The previous prime is 13469002356631. The next prime is 13469002356713. The reversal of 13469002356689 is 98665320096431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13469002356689 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13469002356619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 612227379839 + ... + 612227379860.
It is an arithmetic number, because the mean of its divisors is an integer number (3673364279100).
Almost surely, 213469002356689 is an apocalyptic number.
It is an amenable number.
13469002356689 is a deficient number, since it is larger than the sum of its proper divisors (1224454759711).
13469002356689 is a wasteful number, since it uses less digits than its factorization.
13469002356689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1224454759710.
The product of its (nonzero) digits is 50388480, while the sum is 62.
The spelling of 13469002356689 in words is "thirteen trillion, four hundred sixty-nine billion, two million, three hundred fifty-six thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •