Base | Representation |
---|---|
bin | 11001011110110110… |
… | …11001110110110001 |
3 | 1022022102111020111021 |
4 | 30233123121312301 |
5 | 211004214133313 |
6 | 10141303015441 |
7 | 663006210304 |
oct | 145733316661 |
9 | 38272436437 |
10 | 13680614833 |
11 | 5890394456 |
12 | 279973a581 |
13 | 13a03b4782 |
14 | 93acd8b3b |
15 | 55109578d |
hex | 32f6d9db1 |
13680614833 has 4 divisors (see below), whose sum is σ = 14485356900. Its totient is φ = 12875872768.
The previous prime is 13680614813. The next prime is 13680614869. The reversal of 13680614833 is 33841608631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33841608631 = 10177 ⋅3325303.
It can be written as a sum of positive squares in 2 ways, for example, as 11250420624 + 2430194209 = 106068^2 + 49297^2 .
It is a cyclic number.
It is not a de Polignac number, because 13680614833 - 221 = 13678517681 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13680614833.
It is not an unprimeable number, because it can be changed into a prime (13680614803) 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, 402371008 + ... + 402371041.
It is an arithmetic number, because the mean of its divisors is an integer number (3621339225).
Almost surely, 213680614833 is an apocalyptic number.
It is an amenable number.
13680614833 is a deficient number, since it is larger than the sum of its proper divisors (804742067).
13680614833 is an equidigital number, since it uses as much as digits as its factorization.
13680614833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 804742066.
The product of its (nonzero) digits is 248832, while the sum is 43.
The spelling of 13680614833 in words is "thirteen billion, six hundred eighty million, six hundred fourteen thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •