Base | Representation |
---|---|
bin | 11000110101101000… |
… | …00001011010110111 |
3 | 1021102022200022202101 |
4 | 30122310001122313 |
5 | 204302143344212 |
6 | 10043105522531 |
7 | 651306322564 |
oct | 143264013267 |
9 | 37368608671 |
10 | 13334746807 |
11 | 5723131708 |
12 | 2701943447 |
13 | 1346847235 |
14 | 906dc586b |
15 | 530a26157 |
hex | 31ad016b7 |
13334746807 has 8 divisors (see below), whose sum is σ = 14463513792. Its totient is φ = 12244243200.
The previous prime is 13334746771. The next prime is 13334746819. The reversal of 13334746807 is 70864743331.
13334746807 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13334746807 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13334746847) 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 7 ways as a sum of consecutive naturals, for example, 9565119 + ... + 9566512.
It is an arithmetic number, because the mean of its divisors is an integer number (1807939224).
Almost surely, 213334746807 is an apocalyptic number.
13334746807 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
13334746807 is a deficient number, since it is larger than the sum of its proper divisors (1128766985).
13334746807 is a wasteful number, since it uses less digits than its factorization.
13334746807 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19131689.
The product of its (nonzero) digits is 1016064, while the sum is 46.
The spelling of 13334746807 in words is "thirteen billion, three hundred thirty-four million, seven hundred forty-six thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •