Base | Representation |
---|---|
bin | 1100100100011011… |
… | …0111101101010001 |
3 | 22201010211001022200 |
4 | 3021012313231101 |
5 | 23402222141312 |
6 | 1314444553413 |
7 | 146416465152 |
oct | 31106675521 |
9 | 8633731280 |
10 | 3374021457 |
11 | 1481602294 |
12 | 7a1b52869 |
13 | 41a02b401 |
14 | 240167929 |
15 | 14b3250dc |
hex | c91b7b51 |
3374021457 has 6 divisors (see below), whose sum is σ = 4873586562. Its totient is φ = 2249347632.
The previous prime is 3374021423. The next prime is 3374021479. The reversal of 3374021457 is 7541204733.
It can be written as a sum of positive squares in only one way, i.e., 3131409681 + 242611776 = 55959^2 + 15576^2 .
It is not a de Polignac number, because 3374021457 - 28 = 3374021201 is a prime.
It is a super-2 number, since 2×33740214572 = 22768041584592805698, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3374026457) 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 5 ways as a sum of consecutive naturals, for example, 187445628 + ... + 187445645.
It is an arithmetic number, because the mean of its divisors is an integer number (812264427).
Almost surely, 23374021457 is an apocalyptic number.
It is an amenable number.
3374021457 is a deficient number, since it is larger than the sum of its proper divisors (1499565105).
3374021457 is a wasteful number, since it uses less digits than its factorization.
3374021457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374891279 (or 374891276 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 36.
The square root of 3374021457 is about 58086.3276253543. The cubic root of 3374021457 is about 1499.8550166537.
The spelling of 3374021457 in words is "three billion, three hundred seventy-four million, twenty-one thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •