Base | Representation |
---|---|
bin | 1100100011001001… |
… | …0100000010100001 |
3 | 22200202200021000222 |
4 | 3020302110002201 |
5 | 23344332214411 |
6 | 1314133252425 |
7 | 146322621644 |
oct | 31062240241 |
9 | 8622607028 |
10 | 3368632481 |
11 | 1479561495 |
12 | 7a0194115 |
13 | 418b92576 |
14 | 23d563a5b |
15 | 14ab0d4db |
hex | c8c940a1 |
3368632481 has 2 divisors, whose sum is σ = 3368632482. Its totient is φ = 3368632480.
The previous prime is 3368632471. The next prime is 3368632483. The reversal of 3368632481 is 1842368633.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3366900625 + 1731856 = 58025^2 + 1316^2 .
It is a cyclic number.
It is not a de Polignac number, because 3368632481 - 218 = 3368370337 is a prime.
It is a super-2 number, since 2×33686324812 = 22695369584096430722, which contains 22 as substring.
Together with 3368632483, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3368632483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1684316240 + 1684316241.
It is an arithmetic number, because the mean of its divisors is an integer number (1684316241).
Almost surely, 23368632481 is an apocalyptic number.
It is an amenable number.
3368632481 is a deficient number, since it is larger than the sum of its proper divisors (1).
3368632481 is an equidigital number, since it uses as much as digits as its factorization.
3368632481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 497664, while the sum is 44.
The square root of 3368632481 is about 58039.9214420557. The cubic root of 3368632481 is about 1499.0560699739.
The spelling of 3368632481 in words is "three billion, three hundred sixty-eight million, six hundred thirty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •