Base | Representation |
---|---|
bin | 1010000010010011… |
… | …1010000011110001 |
3 | 20221202021212210100 |
4 | 2200210322003301 |
5 | 21004132421203 |
6 | 1123154223013 |
7 | 123521605365 |
oct | 24044720361 |
9 | 6852255710 |
10 | 2694029553 |
11 | 1162789306 |
12 | 632284a69 |
13 | 33c1a6037 |
14 | 1b7b1b2a5 |
15 | 10b7a5ea3 |
hex | a093a0f1 |
2694029553 has 6 divisors (see below), whose sum is σ = 3891376034. Its totient is φ = 1796019696.
The previous prime is 2694029543. The next prime is 2694029557. The reversal of 2694029553 is 3559204962.
2694029553 is a `hidden beast` number, since 2 + 6 + 94 + 0 + 2 + 9 + 553 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1700077824 + 993951729 = 41232^2 + 31527^2 .
It is not a de Polignac number, because 2694029553 - 26 = 2694029489 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2694029499 and 2694029508.
It is not an unprimeable number, because it can be changed into a prime (2694029557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 149668300 + ... + 149668317.
Almost surely, 22694029553 is an apocalyptic number.
It is an amenable number.
2694029553 is a deficient number, since it is larger than the sum of its proper divisors (1197346481).
2694029553 is a wasteful number, since it uses less digits than its factorization.
2694029553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299336623 (or 299336620 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 45.
The square root of 2694029553 is about 51904.0417790368. The cubic root of 2694029553 is about 1391.4495089052.
The spelling of 2694029553 in words is "two billion, six hundred ninety-four million, twenty-nine thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •