Base | Representation |
---|---|
bin | 1100011100011011… |
… | …1001011011110101 |
3 | 22121210200200000000 |
4 | 3013012321123311 |
5 | 23320130132401 |
6 | 1311245541513 |
7 | 145531363356 |
oct | 30706713365 |
9 | 8553620000 |
10 | 3340474101 |
11 | 14646796a8 |
12 | 792874899 |
13 | 4130b38c3 |
14 | 239913d2d |
15 | 1483ea186 |
hex | c71b96f5 |
3340474101 has 54 divisors (see below), whose sum is σ = 5132337366. Its totient is φ = 2173878000.
The previous prime is 3340474097. The next prime is 3340474133. The reversal of 3340474101 is 1014740433.
It can be written as a sum of positive squares in only one way, i.e., 3307400100 + 33074001 = 57510^2 + 5751^2 .
It is not a de Polignac number, because 3340474101 - 22 = 3340474097 is a prime.
It is a super-2 number, since 2×33404741012 = 22317534438903516402, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3340474201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 33073951 + ... + 33074051.
Almost surely, 23340474101 is an apocalyptic number.
It is an amenable number.
3340474101 is a deficient number, since it is larger than the sum of its proper divisors (1791863265).
3340474101 is an frugal number, since it uses more digits than its factorization.
3340474101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267 (or 175 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 3340474101 is about 57796.8346970662. The cubic root of 3340474101 is about 1494.8675103970.
The spelling of 3340474101 in words is "three billion, three hundred forty million, four hundred seventy-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •