Base | Representation |
---|---|
bin | 11001000100110011000100… |
… | …00000111010101010111011 |
3 | 21020020101002200122212200110 |
4 | 30202121202000322222323 |
5 | 24211410102221203111 |
6 | 313135055501435403 |
7 | 14420523241246425 |
oct | 1442314200725273 |
9 | 236211080585613 |
10 | 55140434553531 |
11 | 16629a21885238 |
12 | 6226703b6bb63 |
13 | 249c94a3c82a2 |
14 | d88b501b9815 |
15 | 6594e12de5a6 |
hex | 32266203aabb |
55140434553531 has 4 divisors (see below), whose sum is σ = 73520579404712. Its totient is φ = 36760289702352.
The previous prime is 55140434553499. The next prime is 55140434553571. The reversal of 55140434553531 is 13535543404155.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 55140434553531 - 25 = 55140434553499 is a prime.
It is a super-2 number, since 2×551404345535312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55140434553571) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9190072425586 + ... + 9190072425591.
It is an arithmetic number, because the mean of its divisors is an integer number (18380144851178).
Almost surely, 255140434553531 is an apocalyptic number.
55140434553531 is a deficient number, since it is larger than the sum of its proper divisors (18380144851181).
55140434553531 is a wasteful number, since it uses less digits than its factorization.
55140434553531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18380144851180.
The product of its (nonzero) digits is 5400000, while the sum is 48.
Adding to 55140434553531 its reverse (13535543404155), we get a palindrome (68675977957686).
The spelling of 55140434553531 in words is "fifty-five trillion, one hundred forty billion, four hundred thirty-four million, five hundred fifty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •