Base | Representation |
---|---|
bin | 110000111101000110110… |
… | …000111010100010000000 |
3 | 102220121110011101020222010 |
4 | 300331012300322202000 |
5 | 420104233013324134 |
6 | 11053245001212520 |
7 | 465023455314033 |
oct | 60750660724200 |
9 | 12817404336863 |
10 | 3364146620544 |
11 | 10877aa078466 |
12 | 463bb1a91140 |
13 | 1b53121c4cc8 |
14 | b8b7b4cb01a |
15 | 5c7986ddce9 |
hex | 30f46c3a880 |
3364146620544 has 32 divisors (see below), whose sum is σ = 8936014461840. Its totient is φ = 1121382206720.
The previous prime is 3364146620501. The next prime is 3364146620581. The reversal of 3364146620544 is 4450266414633.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×33641466205442 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 3364146620493 and 3364146620502.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 4380398862 + ... + 4380399629.
Almost surely, 23364146620544 is an apocalyptic number.
It is an amenable number.
3364146620544 is an abundant number, since it is smaller than the sum of its proper divisors (5571867841296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3364146620544 is an equidigital number, since it uses as much as digits as its factorization.
3364146620544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8760798508 (or 8760798496 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 48.
The spelling of 3364146620544 in words is "three trillion, three hundred sixty-four billion, one hundred forty-six million, six hundred twenty thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •