Base | Representation |
---|---|
bin | 11001000101100101… |
… | …11001001011100001 |
3 | 1021202122200020222022 |
4 | 30202302321023201 |
5 | 210040434344031 |
6 | 10104252151225 |
7 | 654523536341 |
oct | 144262711341 |
9 | 37678606868 |
10 | 13468668641 |
11 | 579179210a |
12 | 273a768515 |
13 | 1368506b1c |
14 | 91aac6d21 |
15 | 53c67b97b |
hex | 322cb92e1 |
13468668641 has 4 divisors (see below), whose sum is σ = 13471654932. Its totient is φ = 13465682352.
The previous prime is 13468668637. The next prime is 13468668649. The reversal of 13468668641 is 14686686431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14686686431 = 6217 ⋅2362343.
It can be written as a sum of positive squares in 2 ways, for example, as 2402470225 + 11066198416 = 49015^2 + 105196^2 .
It is a cyclic number.
It is not a de Polignac number, because 13468668641 - 22 = 13468668637 is a prime.
It is a super-2 number, since 2×134686686412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13468668649) 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, 1486370 + ... + 1495403.
It is an arithmetic number, because the mean of its divisors is an integer number (3367913733).
Almost surely, 213468668641 is an apocalyptic number.
It is an amenable number.
13468668641 is a deficient number, since it is larger than the sum of its proper divisors (2986291).
13468668641 is an equidigital number, since it uses as much as digits as its factorization.
13468668641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2986290.
The product of its digits is 3981312, while the sum is 53.
The spelling of 13468668641 in words is "thirteen billion, four hundred sixty-eight million, six hundred sixty-eight thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •