Base | Representation |
---|---|
bin | 10000000101100110111… |
… | …01101011010010111001 |
3 | 1221211210021002120102201 |
4 | 20002303131223102321 |
5 | 33024031234340230 |
6 | 1101534301030201 |
7 | 54636034360645 |
oct | 10026335532271 |
9 | 1854707076381 |
10 | 552766715065 |
11 | 1a3477444524 |
12 | 8b168555361 |
13 | 401831627b6 |
14 | 1ca7b191c25 |
15 | e5a333a5ca |
hex | 80b376b4b9 |
552766715065 has 4 divisors (see below), whose sum is σ = 663320058084. Its totient is φ = 442213372048.
The previous prime is 552766715027. The next prime is 552766715071. The reversal of 552766715065 is 560517667255.
552766715065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 398195074729 + 154571640336 = 631027^2 + 393156^2 .
It is a cyclic number.
It is not a de Polignac number, because 552766715065 - 231 = 550619231417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 552766714997 and 552766715015.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55276671502 + ... + 55276671511.
It is an arithmetic number, because the mean of its divisors is an integer number (165830014521).
Almost surely, 2552766715065 is an apocalyptic number.
It is an amenable number.
552766715065 is a deficient number, since it is larger than the sum of its proper divisors (110553343019).
552766715065 is a wasteful number, since it uses less digits than its factorization.
552766715065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110553343018.
The product of its (nonzero) digits is 13230000, while the sum is 55.
The spelling of 552766715065 in words is "five hundred fifty-two billion, seven hundred sixty-six million, seven hundred fifteen thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •