Base | Representation |
---|---|
bin | 100110100011011… |
… | …1100111111100101 |
3 | 10100011021011022200 |
4 | 1031012330333211 |
5 | 10122134341300 |
6 | 332211445113 |
7 | 44025666525 |
oct | 11506747745 |
9 | 3304234280 |
10 | 1293668325 |
11 | 604273184 |
12 | 3012b6799 |
13 | 17802c021 |
14 | c3b53685 |
15 | 7888e200 |
hex | 4d1bcfe5 |
1293668325 has 18 divisors (see below), whose sum is σ = 2317104114. Its totient is φ = 689956320.
The previous prime is 1293668323. The next prime is 1293668377. The reversal of 1293668325 is 5238663921.
It can be written as a sum of positive squares in 3 ways, for example, as 690561 + 1292977764 = 831^2 + 35958^2 .
It is not a de Polignac number, because 1293668325 - 21 = 1293668323 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1293668323) 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 17 ways as a sum of consecutive naturals, for example, 2874594 + ... + 2875043.
Almost surely, 21293668325 is an apocalyptic number.
1293668325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1293668325 is a deficient number, since it is larger than the sum of its proper divisors (1023435789).
1293668325 is a wasteful number, since it uses less digits than its factorization.
1293668325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5749653 (or 5749645 counting only the distinct ones).
The product of its digits is 466560, while the sum is 45.
The square root of 1293668325 is about 35967.6010459413. The cubic root of 1293668325 is about 1089.6181152462.
The spelling of 1293668325 in words is "one billion, two hundred ninety-three million, six hundred sixty-eight thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •