Base | Representation |
---|---|
bin | 110011010000000111… |
… | …100100000100011110 |
3 | 12021001020000012211000 |
4 | 303100013210010132 |
5 | 1400201000014410 |
6 | 41140410411130 |
7 | 3655503626454 |
oct | 632007440436 |
9 | 167036005730 |
10 | 55031251230 |
11 | 2137a78561a |
12 | a7b9a30aa6 |
13 | 5260220c67 |
14 | 2940a089d4 |
15 | 1671420dc0 |
hex | cd01e411e |
55031251230 has 64 divisors (see below), whose sum is σ = 147228238080. Its totient is φ = 14627176992.
The previous prime is 55031251201. The next prime is 55031251273. The reversal of 55031251230 is 3215213055.
It is a happy number.
55031251230 is a `hidden beast` number, since 5 + 503 + 125 + 1 + 2 + 30 = 666.
It is a super-2 number, since 2×550312512302 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 55031251194 and 55031251203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 249064 + ... + 414843.
It is an arithmetic number, because the mean of its divisors is an integer number (2300441220).
Almost surely, 255031251230 is an apocalyptic number.
55031251230 is an abundant number, since it is smaller than the sum of its proper divisors (92196986850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55031251230 is a wasteful number, since it uses less digits than its factorization.
55031251230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 664230 (or 664224 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
Adding to 55031251230 its reverse (3215213055), we get a palindrome (58246464285).
The spelling of 55031251230 in words is "fifty-five billion, thirty-one million, two hundred fifty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •