Base | Representation |
---|---|
bin | 1100100101100100… |
… | …0101101111111101 |
3 | 22201110210200220120 |
4 | 3021121011233331 |
5 | 23404433010230 |
6 | 1315135205153 |
7 | 146505206523 |
oct | 31131055775 |
9 | 8643720816 |
10 | 3378797565 |
11 | 1484274690 |
12 | 7a36767b9 |
13 | 41b011300 |
14 | 240a4c313 |
15 | 14b96a310 |
hex | c9645bfd |
3378797565 has 48 divisors (see below), whose sum is σ = 6386143680. Its totient is φ = 1512176640.
The previous prime is 3378797551. The next prime is 3378797567. The reversal of 3378797565 is 5657978733.
It is not a de Polignac number, because 3378797565 - 26 = 3378797501 is a prime.
It is a super-2 number, since 2×33787975652 = 22832545970499858450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3378797499 and 3378797508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3378797567) 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 47 ways as a sum of consecutive naturals, for example, 32700 + ... + 88469.
It is an arithmetic number, because the mean of its divisors is an integer number (133044660).
Almost surely, 23378797565 is an apocalyptic number.
It is an amenable number.
3378797565 is a deficient number, since it is larger than the sum of its proper divisors (3007346115).
3378797565 is a wasteful number, since it uses less digits than its factorization.
3378797565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121214 (or 121201 counting only the distinct ones).
The product of its digits is 33339600, while the sum is 60.
The square root of 3378797565 is about 58127.4252397266. The cubic root of 3378797565 is about 1500.5623913399.
The spelling of 3378797565 in words is "three billion, three hundred seventy-eight million, seven hundred ninety-seven thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •