Base | Representation |
---|---|
bin | 110011011101010010… |
… | …001001101101001001 |
3 | 12021121121122001101122 |
4 | 303131102021231021 |
5 | 1401124021140013 |
6 | 41214340525025 |
7 | 3664125234650 |
oct | 633522115511 |
9 | 167547561348 |
10 | 55252130633 |
11 | 21483429587 |
12 | a85b9b0775 |
13 | 5296c08a2b |
14 | 29620a4197 |
15 | 1685a01a08 |
hex | cdd489b49 |
55252130633 has 8 divisors (see below), whose sum is σ = 64034663040. Its totient is φ = 46691940960.
The previous prime is 55252130623. The next prime is 55252130639. The reversal of 55252130633 is 33603125255.
55252130633 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 not a de Polignac number, because 55252130633 - 214 = 55252114249 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 55252130593 and 55252130602.
It is not an unprimeable number, because it can be changed into a prime (55252130639) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55585148 + ... + 55586141.
It is an arithmetic number, because the mean of its divisors is an integer number (8004332880).
Almost surely, 255252130633 is an apocalyptic number.
It is an amenable number.
55252130633 is a deficient number, since it is larger than the sum of its proper divisors (8782532407).
55252130633 is a wasteful number, since it uses less digits than its factorization.
55252130633 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111171367.
The product of its (nonzero) digits is 81000, while the sum is 35.
Adding to 55252130633 its reverse (33603125255), we get a palindrome (88855255888).
The spelling of 55252130633 in words is "fifty-five billion, two hundred fifty-two million, one hundred thirty thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •