Base | Representation |
---|---|
bin | 110011001110100101… |
… | …100111101001001001 |
3 | 12020222102200202200102 |
4 | 303032211213221021 |
5 | 1400122411411003 |
6 | 41134052215145 |
7 | 3655042452032 |
oct | 631645475111 |
9 | 166872622612 |
10 | 55005575753 |
11 | 21367239217 |
12 | a7b130a4b5 |
13 | 5257b0147b |
14 | 293b443a89 |
15 | 166e04d588 |
hex | cce967a49 |
55005575753 has 16 divisors (see below), whose sum is σ = 56889216000. Its totient is φ = 53153413632.
The previous prime is 55005575743. The next prime is 55005575777. The reversal of 55005575753 is 35757550055.
It is a cyclic number.
It is not a de Polignac number, because 55005575753 - 224 = 54988798537 is a prime.
It is a super-2 number, since 2×550055757532 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55005575698 and 55005575707.
It is not an unprimeable number, because it can be changed into a prime (55005575743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2998433 + ... + 3016721.
It is an arithmetic number, because the mean of its divisors is an integer number (3555576000).
Almost surely, 255005575753 is an apocalyptic number.
It is an amenable number.
55005575753 is a deficient number, since it is larger than the sum of its proper divisors (1883640247).
55005575753 is a wasteful number, since it uses less digits than its factorization.
55005575753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19144.
The product of its (nonzero) digits is 2296875, while the sum is 47.
The spelling of 55005575753 in words is "fifty-five billion, five million, five hundred seventy-five thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •