Base | Representation |
---|---|
bin | 1011100011000001010000… |
… | …0001011001001001011101 |
3 | 1122221202021010200000122001 |
4 | 2320300110001121021131 |
5 | 3131003414331031240 |
6 | 43000325253522301 |
7 | 2450163065613601 |
oct | 270602401311135 |
9 | 48852233600561 |
10 | 12696259236445 |
11 | 40554a9391474 |
12 | 1510753643391 |
13 | 711337b62965 |
14 | 31c706171501 |
15 | 1703d38ad89a |
hex | b8c1405925d |
12696259236445 has 8 divisors (see below), whose sum is σ = 15522973557336. Its totient is φ = 9965365740096.
The previous prime is 12696259236433. The next prime is 12696259236461. The reversal of 12696259236445 is 54463295269621.
It can be written as a sum of positive squares in 4 ways, for example, as 382708025956 + 12313551210489 = 618634^2 + 3509067^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12696259236445 - 237 = 12558820282973 is a prime.
It is a super-2 number, since 2×126962592364452 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23955205842 + ... + 23955206371.
It is an arithmetic number, because the mean of its divisors is an integer number (1940371694667).
Almost surely, 212696259236445 is an apocalyptic number.
It is an amenable number.
12696259236445 is a deficient number, since it is larger than the sum of its proper divisors (2826714320891).
12696259236445 is an equidigital number, since it uses as much as digits as its factorization.
12696259236445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47910412271.
The product of its digits is 167961600, while the sum is 64.
The spelling of 12696259236445 in words is "twelve trillion, six hundred ninety-six billion, two hundred fifty-nine million, two hundred thirty-six thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •