Base | Representation |
---|---|
bin | 110011010010001000… |
… | …010100000010010011 |
3 | 12021010120111221100101 |
4 | 303102020110002103 |
5 | 1400233120032011 |
6 | 41144014033231 |
7 | 3656363536546 |
oct | 632210240223 |
9 | 167116457311 |
10 | 55065002131 |
11 | 21397838127 |
12 | a8091a8817 |
13 | 526720a2c9 |
14 | 29452b285d |
15 | 167438b2c1 |
hex | cd2214093 |
55065002131 has 4 divisors (see below), whose sum is σ = 55066224064. Its totient is φ = 55063780200.
The previous prime is 55065002119. The next prime is 55065002219. The reversal of 55065002131 is 13120056055.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 55065002131 - 213 = 55064993939 is a prime.
It is a super-2 number, since 2×550650021312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 55065002131.
It is not an unprimeable number, because it can be changed into a prime (55065006131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 540675 + ... + 634396.
It is an arithmetic number, because the mean of its divisors is an integer number (13766556016).
Almost surely, 255065002131 is an apocalyptic number.
55065002131 is a deficient number, since it is larger than the sum of its proper divisors (1221933).
55065002131 is a wasteful number, since it uses less digits than its factorization.
55065002131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1221932.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 55065002131 its reverse (13120056055), we get a palindrome (68185058186).
The spelling of 55065002131 in words is "fifty-five billion, sixty-five million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •