Base | Representation |
---|---|
bin | 110011110010101001… |
… | …011101010001011111 |
3 | 12022112121002020021210 |
4 | 303302221131101133 |
5 | 1402342300433011 |
6 | 41314103155503 |
7 | 4006036655202 |
oct | 636251352137 |
9 | 168477066253 |
10 | 55610561631 |
11 | 21647792049 |
12 | a93ba45b93 |
13 | 5323254591 |
14 | 2997927939 |
15 | 16a72036a6 |
hex | cf2a5d45f |
55610561631 has 4 divisors (see below), whose sum is σ = 74147415512. Its totient is φ = 37073707752.
The previous prime is 55610561603. The next prime is 55610561659. The reversal of 55610561631 is 13616501655.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (55610561603) and next prime (55610561659).
It is not a de Polignac number, because 55610561631 - 29 = 55610561119 is a prime.
It is a super-2 number, since 2×556105616312 (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 55610561631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55610561131) 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, 9268426936 + ... + 9268426941.
It is an arithmetic number, because the mean of its divisors is an integer number (18536853878).
Almost surely, 255610561631 is an apocalyptic number.
55610561631 is a deficient number, since it is larger than the sum of its proper divisors (18536853881).
55610561631 is a wasteful number, since it uses less digits than its factorization.
55610561631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18536853880.
The product of its (nonzero) digits is 81000, while the sum is 39.
The spelling of 55610561631 in words is "fifty-five billion, six hundred ten million, five hundred sixty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •