Base | Representation |
---|---|
bin | 1010000010001100… |
… | …0110011010010000 |
3 | 20221201101211000000 |
4 | 2200203012122100 |
5 | 21004022241411 |
6 | 1123140130000 |
7 | 123514563345 |
oct | 24043063220 |
9 | 6851354000 |
10 | 2693555856 |
11 | 1162495422 |
12 | 632096900 |
13 | 33c06b544 |
14 | 1b7a367cc |
15 | 10b710956 |
hex | a08c6690 |
2693555856 has 70 divisors (see below), whose sum is σ = 7824601190. Its totient is φ = 897848064.
The previous prime is 2693555773. The next prime is 2693555903. The reversal of 2693555856 is 6585553962.
2693555856 is a `hidden beast` number, since 2 + 6 + 9 + 3 + 55 + 585 + 6 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2687385600 + 6170256 = 51840^2 + 2484^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 103801 + ... + 127128.
It is an arithmetic number, because the mean of its divisors is an integer number (111780017).
Almost surely, 22693555856 is an apocalyptic number.
It is an amenable number.
2693555856 is an abundant number, since it is smaller than the sum of its proper divisors (5131045334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2693555856 is an equidigital number, since it uses as much as digits as its factorization.
2693555856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230955 (or 230934 counting only the distinct ones).
The product of its digits is 9720000, while the sum is 54.
The square root of 2693555856 is about 51899.4783788816. The cubic root of 2693555856 is about 1391.3679502733.
The spelling of 2693555856 in words is "two billion, six hundred ninety-three million, five hundred fifty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •