Base | Representation |
---|---|
bin | 1100011111110000… |
… | …0101010011101001 |
3 | 22122202221000012000 |
4 | 3013330011103221 |
5 | 23332212310421 |
6 | 1312504441213 |
7 | 146061032352 |
oct | 30774052351 |
9 | 8582830160 |
10 | 3354416361 |
11 | 147153172a |
12 | 797479209 |
13 | 415c5596a |
14 | 23b702d29 |
15 | 149751226 |
hex | c7f054e9 |
3354416361 has 8 divisors (see below), whose sum is σ = 4969505760. Its totient is φ = 2236277556.
The previous prime is 3354416339. The next prime is 3354416383. The reversal of 3354416361 is 1636144533.
It is an interprime number because it is at equal distance from previous prime (3354416339) and next prime (3354416383).
It is not a de Polignac number, because 3354416361 - 218 = 3354154217 is a prime.
It is a super-2 number, since 2×33544163612 = 22504218245888964642, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3354416321) 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 7 ways as a sum of consecutive naturals, for example, 62118795 + ... + 62118848.
It is an arithmetic number, because the mean of its divisors is an integer number (621188220).
Almost surely, 23354416361 is an apocalyptic number.
It is an amenable number.
3354416361 is a deficient number, since it is larger than the sum of its proper divisors (1615089399).
3354416361 is a wasteful number, since it uses less digits than its factorization.
3354416361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124237652 (or 124237646 counting only the distinct ones).
The product of its digits is 77760, while the sum is 36.
The square root of 3354416361 is about 57917.3234965153. The cubic root of 3354416361 is about 1496.9443515685.
The spelling of 3354416361 in words is "three billion, three hundred fifty-four million, four hundred sixteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •