Base | Representation |
---|---|
bin | 11000110110010100… |
… | …11100110110100011 |
3 | 1021102201202000221211 |
4 | 30123022130312203 |
5 | 204310200020324 |
6 | 10043435530551 |
7 | 651410311225 |
oct | 143312346643 |
9 | 37381660854 |
10 | 13340626339 |
11 | 5726488027 |
12 | 27038b9a57 |
13 | 1347b25451 |
14 | 907ab6415 |
15 | 5312d8294 |
hex | 31b29cda3 |
13340626339 has 4 divisors (see below), whose sum is σ = 13342760640. Its totient is φ = 13338492040.
The previous prime is 13340626319. The next prime is 13340626367. The reversal of 13340626339 is 93362604331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 93362604331 = 41 ⋅2277136691.
It is a cyclic number.
It is not a de Polignac number, because 13340626339 - 25 = 13340626307 is a prime.
It is a super-2 number, since 2×133406263392 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13340626319) 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, 1057747 + ... + 1070284.
It is an arithmetic number, because the mean of its divisors is an integer number (3335690160).
Almost surely, 213340626339 is an apocalyptic number.
13340626339 is a deficient number, since it is larger than the sum of its proper divisors (2134301).
13340626339 is an equidigital number, since it uses as much as digits as its factorization.
13340626339 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2134300.
The product of its (nonzero) digits is 209952, while the sum is 40.
The spelling of 13340626339 in words is "thirteen billion, three hundred forty million, six hundred twenty-six thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •