Base | Representation |
---|---|
bin | 11000010111101100… |
… | …00100110010101011 |
3 | 1020202211011002200110 |
4 | 30023312010302223 |
5 | 203243402023132 |
6 | 10002135305403 |
7 | 642136664106 |
oct | 141366046253 |
9 | 36684132613 |
10 | 13083626667 |
11 | 5604403401 |
12 | 265181b263 |
13 | 1306801a37 |
14 | 8c18d773d |
15 | 5189701cc |
hex | 30bd84cab |
13083626667 has 4 divisors (see below), whose sum is σ = 17444835560. Its totient is φ = 8722417776.
The previous prime is 13083626657. The next prime is 13083626671. The reversal of 13083626667 is 76662638031.
It is a happy number.
13083626667 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13083626667 - 215 = 13083593899 is a prime.
It is a super-2 number, since 2×130836266672 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13083626617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2180604442 + ... + 2180604447.
It is an arithmetic number, because the mean of its divisors is an integer number (4361208890).
Almost surely, 213083626667 is an apocalyptic number.
13083626667 is a deficient number, since it is larger than the sum of its proper divisors (4361208893).
13083626667 is an equidigital number, since it uses as much as digits as its factorization.
13083626667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4361208892.
The product of its (nonzero) digits is 1306368, while the sum is 48.
The spelling of 13083626667 in words is "thirteen billion, eighty-three million, six hundred twenty-six thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •