Base | Representation |
---|---|
bin | 11001001111100100… |
… | …11110010000001110 |
3 | 1021222111022111202022 |
4 | 30213302132100032 |
5 | 210223411210210 |
6 | 10120443530142 |
7 | 656561606540 |
oct | 144762362016 |
9 | 37874274668 |
10 | 13552444430 |
11 | 58250020a8 |
12 | 2762829952 |
13 | 137c9899b5 |
14 | 927c93690 |
15 | 544bc9155 |
hex | 327c9e40e |
13552444430 has 64 divisors (see below), whose sum is σ = 29271421440. Its totient is φ = 4419321984.
The previous prime is 13552444361. The next prime is 13552444457. The reversal of 13552444430 is 3444425531.
13552444430 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 86189 + ... + 185831.
It is an arithmetic number, because the mean of its divisors is an integer number (457365960).
Almost surely, 213552444430 is an apocalyptic number.
13552444430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13552444430 is an abundant number, since it is smaller than the sum of its proper divisors (15718977010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13552444430 is a wasteful number, since it uses less digits than its factorization.
13552444430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99753.
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 13552444430 its reverse (3444425531), we get a palindrome (16996869961).
The spelling of 13552444430 in words is "thirteen billion, five hundred fifty-two million, four hundred forty-four thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •