Base | Representation |
---|---|
bin | 10011010111000010111… |
… | …110010000010001100101 |
3 | 11201012000222102001000212 |
4 | 103113002332100101211 |
5 | 133244142443301312 |
6 | 2455103515545205 |
7 | 165055643234531 |
oct | 23270276202145 |
9 | 4635028361025 |
10 | 1330415993957 |
11 | 473254165686 |
12 | 195a1575b205 |
13 | 985c47109bb |
14 | 4856cd5cbc1 |
15 | 24919321822 |
hex | 135c2f90465 |
1330415993957 has 2 divisors, whose sum is σ = 1330415993958. Its totient is φ = 1330415993956.
The previous prime is 1330415993909. The next prime is 1330415993987. The reversal of 1330415993957 is 7593995140331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 746912506081 + 583503487876 = 864241^2 + 763874^2 .
It is a cyclic number.
It is not a de Polignac number, because 1330415993957 - 28 = 1330415993701 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1330415993896 and 1330415993905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1330415993987) 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 as a sum of consecutive naturals, namely, 665207996978 + 665207996979.
It is an arithmetic number, because the mean of its divisors is an integer number (665207996979).
Almost surely, 21330415993957 is an apocalyptic number.
It is an amenable number.
1330415993957 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330415993957 is an equidigital number, since it uses as much as digits as its factorization.
1330415993957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13778100, while the sum is 59.
The spelling of 1330415993957 in words is "one trillion, three hundred thirty billion, four hundred fifteen million, nine hundred ninety-three thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •