Base | Representation |
---|---|
bin | 11000110111010000… |
… | …11000101001100111 |
3 | 1021110021111201011110 |
4 | 30123220120221213 |
5 | 204314202122242 |
6 | 10044320040103 |
7 | 651534103131 |
oct | 143350305147 |
9 | 37407451143 |
10 | 13348473447 |
11 | 572a957741 |
12 | 2706463033 |
13 | 13496420ca |
14 | 908b5a051 |
15 | 531d3839c |
hex | 31ba18a67 |
13348473447 has 4 divisors (see below), whose sum is σ = 17797964600. Its totient is φ = 8898982296.
The previous prime is 13348473409. The next prime is 13348473451. The reversal of 13348473447 is 74437484331.
13348473447 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 a de Polignac number, because none of the positive numbers 2k-13348473447 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13348473396 and 13348473405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13348473497) 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, 2224745572 + ... + 2224745577.
It is an arithmetic number, because the mean of its divisors is an integer number (4449491150).
Almost surely, 213348473447 is an apocalyptic number.
13348473447 is a deficient number, since it is larger than the sum of its proper divisors (4449491153).
13348473447 is an equidigital number, since it uses as much as digits as its factorization.
13348473447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4449491152.
The product of its digits is 2709504, while the sum is 48.
The spelling of 13348473447 in words is "thirteen billion, three hundred forty-eight million, four hundred seventy-three thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •