Base | Representation |
---|---|
bin | 1100011100011000… |
… | …0000111001111001 |
3 | 22121210020220101011 |
4 | 3013012000321321 |
5 | 23320100230203 |
6 | 1311240553521 |
7 | 145526410324 |
oct | 30706007171 |
9 | 8553226334 |
10 | 3340242553 |
11 | 146453073a |
12 | 7927828a1 |
13 | 4130323ab |
14 | 2398937bb |
15 | 1483a176d |
hex | c7180e79 |
3340242553 has 4 divisors (see below), whose sum is σ = 3340488448. Its totient is φ = 3339996660.
The previous prime is 3340242547. The next prime is 3340242611. The reversal of 3340242553 is 3552420433.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3340242553 is a prime.
It is a super-2 number, since 2×33402425532 = 22314440625743915618, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3340242523) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101301 + ... + 130162.
It is an arithmetic number, because the mean of its divisors is an integer number (835122112).
Almost surely, 23340242553 is an apocalyptic number.
It is an amenable number.
3340242553 is a deficient number, since it is larger than the sum of its proper divisors (245895).
3340242553 is a wasteful number, since it uses less digits than its factorization.
3340242553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245894.
The product of its (nonzero) digits is 43200, while the sum is 31.
The square root of 3340242553 is about 57794.8315422755. The cubic root of 3340242553 is about 1494.8329702319.
Adding to 3340242553 its reverse (3552420433), we get a palindrome (6892662986).
The spelling of 3340242553 in words is "three billion, three hundred forty million, two hundred forty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •