Base | Representation |
---|---|
bin | 1100100000000010… |
… | …1100011001011101 |
3 | 22122212012102012101 |
4 | 3020000230121131 |
5 | 23333020000203 |
6 | 1312550405101 |
7 | 146104225264 |
oct | 31000543135 |
9 | 8585172171 |
10 | 3355625053 |
11 | 1472187850 |
12 | 797960791 |
13 | 416289b71 |
14 | 23b9395db |
15 | 1498de41d |
hex | c802c65d |
3355625053 has 16 divisors (see below), whose sum is σ = 3980781504. Its totient is φ = 2793519360.
The previous prime is 3355625047. The next prime is 3355625057. The reversal of 3355625053 is 3505265533.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 3355625053 - 213 = 3355616861 is a prime.
It is a super-2 number, since 2×33556250532 = 22520438992642505618, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3355625057) 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 15 ways as a sum of consecutive naturals, for example, 235575 + ... + 249412.
It is an arithmetic number, because the mean of its divisors is an integer number (248798844).
Almost surely, 23355625053 is an apocalyptic number.
It is an amenable number.
3355625053 is a deficient number, since it is larger than the sum of its proper divisors (625156451).
3355625053 is a wasteful number, since it uses less digits than its factorization.
3355625053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485052.
The product of its (nonzero) digits is 202500, while the sum is 37.
The square root of 3355625053 is about 57927.7571894511. The cubic root of 3355625053 is about 1497.1241272425.
The spelling of 3355625053 in words is "three billion, three hundred fifty-five million, six hundred twenty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •