Base | Representation |
---|---|
bin | 1001111100001000… |
… | …1010101110100101 |
3 | 20212221120211122102 |
4 | 2133002022232211 |
5 | 20431021124243 |
6 | 1120431341445 |
7 | 123055602032 |
oct | 23702125645 |
9 | 6787524572 |
10 | 2668145573 |
11 | 114a10a295 |
12 | 625681885 |
13 | 336a12682 |
14 | 1b4500389 |
15 | 1093919b8 |
hex | 9f08aba5 |
2668145573 has 2 divisors, whose sum is σ = 2668145574. Its totient is φ = 2668145572.
The previous prime is 2668145537. The next prime is 2668145581. The reversal of 2668145573 is 3755418662.
2668145573 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (2668145537) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1642032484 + 1026113089 = 40522^2 + 32033^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2668145573 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2668145503) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1334072786 + 1334072787.
It is an arithmetic number, because the mean of its divisors is an integer number (1334072787).
Almost surely, 22668145573 is an apocalyptic number.
It is an amenable number.
2668145573 is a deficient number, since it is larger than the sum of its proper divisors (1).
2668145573 is an equidigital number, since it uses as much as digits as its factorization.
2668145573 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1209600, while the sum is 47.
The square root of 2668145573 is about 51654.0954136262. The cubic root of 2668145573 is about 1386.9788554204.
The spelling of 2668145573 in words is "two billion, six hundred sixty-eight million, one hundred forty-five thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •