Base | Representation |
---|---|
bin | 110011010010101111… |
… | …100110111001111001 |
3 | 12021011021220021112021 |
4 | 303102233212321321 |
5 | 1400243234144113 |
6 | 41145022514441 |
7 | 3656550231412 |
oct | 632257467171 |
9 | 167137807467 |
10 | 55075303033 |
11 | 213a2633373 |
12 | a810735a21 |
13 | 52693a5b0a |
14 | 29467d4809 |
15 | 167522348d |
hex | cd2be6e79 |
55075303033 has 4 divisors (see below), whose sum is σ = 56114459748. Its totient is φ = 54036146320.
The previous prime is 55075303001. The next prime is 55075303051. The reversal of 55075303033 is 33030357055.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 37555339264 + 17519963769 = 193792^2 + 132363^2 .
It is a cyclic number.
It is not a de Polignac number, because 55075303033 - 25 = 55075303001 is a prime.
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 55075303033.
It is not an unprimeable number, because it can be changed into a prime (55075373033) 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, 519578278 + ... + 519578383.
It is an arithmetic number, because the mean of its divisors is an integer number (14028614937).
Almost surely, 255075303033 is an apocalyptic number.
55075303033 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
55075303033 is a deficient number, since it is larger than the sum of its proper divisors (1039156715).
55075303033 is a wasteful number, since it uses less digits than its factorization.
55075303033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1039156714.
The product of its (nonzero) digits is 70875, while the sum is 34.
The spelling of 55075303033 in words is "fifty-five billion, seventy-five million, three hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •