Base | Representation |
---|---|
bin | 1100011001100100… |
… | …11111010100101001 |
3 | 122011221100022010021 |
4 | 12030302133110221 |
5 | 102113143404113 |
6 | 3020322520441 |
7 | 323652451156 |
oct | 61462372451 |
9 | 18157308107 |
10 | 6657013033 |
11 | 290678a470 |
12 | 1359506121 |
13 | 821236b88 |
14 | 47219722d |
15 | 28e66848d |
hex | 18cc9f529 |
6657013033 has 16 divisors (see below), whose sum is σ = 7670577600. Its totient is φ = 5713692480.
The previous prime is 6657013031. The next prime is 6657013039. The reversal of 6657013033 is 3303107566.
6657013033 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 6657013033 - 21 = 6657013031 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6657013033.
It is not an unprimeable number, because it can be changed into a prime (6657013031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6883 + ... + 115591.
It is an arithmetic number, because the mean of its divisors is an integer number (479411100).
Almost surely, 26657013033 is an apocalyptic number.
It is an amenable number.
6657013033 is a deficient number, since it is larger than the sum of its proper divisors (1013564567).
6657013033 is a wasteful number, since it uses less digits than its factorization.
6657013033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109032.
The product of its (nonzero) digits is 34020, while the sum is 34.
The square root of 6657013033 is about 81590.5204849191. The cubic root of 6657013033 is about 1881.1631772118.
The spelling of 6657013033 in words is "six billion, six hundred fifty-seven million, thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •