Base | Representation |
---|---|
bin | 1011100010100111011110… |
… | …0101110101011111001001 |
3 | 1122221002101220112012120112 |
4 | 2320221313211311133021 |
5 | 3130400231442040442 |
6 | 42553222514204105 |
7 | 2446526445434204 |
oct | 270516745653711 |
9 | 48832356465515 |
10 | 12689339799497 |
11 | 4052578563039 |
12 | 150b342283635 |
13 | 7107a445647a |
14 | 31c24b1c693b |
15 | 17012b1aa082 |
hex | b8a779757c9 |
12689339799497 has 4 divisors (see below), whose sum is σ = 12698232120336. Its totient is φ = 12680447478660.
The previous prime is 12689339799473. The next prime is 12689339799559. The reversal of 12689339799497 is 79499793398621.
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-12689339799497 is a prime.
It is a super-2 number, since 2×126893397994972 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12689339790497) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4446158279 + ... + 4446161132.
It is an arithmetic number, because the mean of its divisors is an integer number (3174558030084).
Almost surely, 212689339799497 is an apocalyptic number.
It is an amenable number.
12689339799497 is a deficient number, since it is larger than the sum of its proper divisors (8892320839).
12689339799497 is an equidigital number, since it uses as much as digits as its factorization.
12689339799497 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8892320838.
The product of its digits is 9999593856, while the sum is 86.
The spelling of 12689339799497 in words is "twelve trillion, six hundred eighty-nine billion, three hundred thirty-nine million, seven hundred ninety-nine thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •