Base | Representation |
---|---|
bin | 100110110110010100010… |
… | …100010001011011001001 |
3 | 100110012212101222122112212 |
4 | 212312110110101123021 |
5 | 322214432214024113 |
6 | 5402232023514505 |
7 | 363606511236533 |
oct | 46662424213311 |
9 | 10405771878485 |
10 | 2669663033033 |
11 | 93a21a203157 |
12 | 3714948b8a35 |
13 | 164995897289 |
14 | 932d8ab2853 |
15 | 4969da990a8 |
hex | 26d945116c9 |
2669663033033 has 8 divisors (see below), whose sum is σ = 2735677379400. Its totient is φ = 2603691573120.
The previous prime is 2669663033029. The next prime is 2669663033083. The reversal of 2669663033033 is 3303303669662.
It can be written as a sum of positive squares in 4 ways, for example, as 1062822850489 + 1606840182544 = 1030933^2 + 1267612^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2669663033033 - 22 = 2669663033029 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2669663033083) 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 7 ways as a sum of consecutive naturals, for example, 10595558 + ... + 10844591.
It is an arithmetic number, because the mean of its divisors is an integer number (341959672425).
Almost surely, 22669663033033 is an apocalyptic number.
It is an amenable number.
2669663033033 is a deficient number, since it is larger than the sum of its proper divisors (66014346367).
2669663033033 is a wasteful number, since it uses less digits than its factorization.
2669663033033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21443227.
The product of its (nonzero) digits is 5668704, while the sum is 50.
The spelling of 2669663033033 in words is "two trillion, six hundred sixty-nine billion, six hundred sixty-three million, thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •