Base | Representation |
---|---|
bin | 11000010001010110… |
… | …01100111001100111 |
3 | 1020122010002011200000 |
4 | 30020223030321213 |
5 | 203141243212042 |
6 | 5552555352343 |
7 | 640622644353 |
oct | 141053147147 |
9 | 36563064600 |
10 | 13030444647 |
11 | 5587389a20 |
12 | 2637a526b3 |
13 | 12c87a119c |
14 | 8b8812463 |
15 | 513e6774c |
hex | 308acce67 |
13030444647 has 48 divisors (see below), whose sum is σ = 21550209408. Its totient is φ = 7801958880.
The previous prime is 13030444639. The next prime is 13030444649. The reversal of 13030444647 is 74644403031.
13030444647 is a `hidden beast` number, since 1 + 3 + 0 + 3 + 0 + 4 + 4 + 4 + 647 = 666.
13030444647 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13030444647 - 23 = 13030444639 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13030444649) 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 47 ways as a sum of consecutive naturals, for example, 192493 + ... + 251225.
It is an arithmetic number, because the mean of its divisors is an integer number (448962696).
Almost surely, 213030444647 is an apocalyptic number.
13030444647 is a deficient number, since it is larger than the sum of its proper divisors (8519764761).
13030444647 is an equidigital number, since it uses as much as digits as its factorization.
13030444647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58842 (or 58830 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 36.
Adding to 13030444647 its reverse (74644403031), we get a palindrome (87674847678).
The spelling of 13030444647 in words is "thirteen billion, thirty million, four hundred forty-four thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •