Base | Representation |
---|---|
bin | 11000111011100101… |
… | …10101010000101010 |
3 | 1021112210210120212211 |
4 | 30131302311100222 |
5 | 204403000012011 |
6 | 10052053555334 |
7 | 652454431606 |
oct | 143562652052 |
9 | 37483716784 |
10 | 13384766506 |
11 | 5749396201 |
12 | 2716645b4a |
13 | 135400b5a7 |
14 | 90d8c6506 |
15 | 535106b21 |
hex | 31dcb542a |
13384766506 has 8 divisors (see below), whose sum is σ = 20078468100. Its totient is φ = 6691943808.
The previous prime is 13384766503. The next prime is 13384766509. The reversal of 13384766506 is 60566748331.
13384766506 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13384766503) and next prime (13384766509).
It can be written as a sum of positive squares in 2 ways, for example, as 13244557225 + 140209281 = 115085^2 + 11841^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 13384766506.
It is not an unprimeable number, because it can be changed into a prime (13384766503) 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, 180231 + ... + 243418.
Almost surely, 213384766506 is an apocalyptic number.
13384766506 is a deficient number, since it is larger than the sum of its proper divisors (6693701594).
13384766506 is a wasteful number, since it uses less digits than its factorization.
13384766506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439448.
The product of its (nonzero) digits is 2177280, while the sum is 49.
The spelling of 13384766506 in words is "thirteen billion, three hundred eighty-four million, seven hundred sixty-six thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •