Base | Representation |
---|---|
bin | 11001001111010011… |
… | …01010001100100110 |
3 | 1021222022222010111211 |
4 | 30213221222030212 |
5 | 210222313242204 |
6 | 10120322222034 |
7 | 656533145002 |
oct | 144751521446 |
9 | 37868863454 |
10 | 13550134054 |
11 | 58237742a6 |
12 | 2761ab491a |
13 | 137c35b202 |
14 | 927851702 |
15 | 5448be804 |
hex | 327a6a326 |
13550134054 has 8 divisors (see below), whose sum is σ = 20381818320. Its totient is φ = 6756194616.
The previous prime is 13550134021. The next prime is 13550134057. The reversal of 13550134054 is 45043105531.
13550134054 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 super-3 number, since 3×135501340543 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13550134057) 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, 9435309 + ... + 9436744.
It is an arithmetic number, because the mean of its divisors is an integer number (2547727290).
Almost surely, 213550134054 is an apocalyptic number.
13550134054 is a deficient number, since it is larger than the sum of its proper divisors (6831684266).
13550134054 is a wasteful number, since it uses less digits than its factorization.
13550134054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18872414.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 13550134054 its reverse (45043105531), we get a palindrome (58593239585).
The spelling of 13550134054 in words is "thirteen billion, five hundred fifty million, one hundred thirty-four thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •