Base | Representation |
---|---|
bin | 10011110011010001110… |
… | …101111110011101011111 |
3 | 11211002021122000221222101 |
4 | 103303101311332131133 |
5 | 134243233421100101 |
6 | 2521035535425531 |
7 | 200211110212123 |
oct | 23632165763537 |
9 | 4732248027871 |
10 | 1360730253151 |
11 | 48509a832255 |
12 | 19b8759852a7 |
13 | 9b415c26c89 |
14 | 49c0700d583 |
15 | 255e0824401 |
hex | 13cd1d7e75f |
1360730253151 has 2 divisors, whose sum is σ = 1360730253152. Its totient is φ = 1360730253150.
The previous prime is 1360730253089. The next prime is 1360730253203. The reversal of 1360730253151 is 1513520370631.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1360730253151 - 217 = 1360730122079 is a prime.
It is a super-3 number, since 3×13607302531513 (a number of 37 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1360730253151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1360730253451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 680365126575 + 680365126576.
It is an arithmetic number, because the mean of its divisors is an integer number (680365126576).
Almost surely, 21360730253151 is an apocalyptic number.
1360730253151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1360730253151 is an equidigital number, since it uses as much as digits as its factorization.
1360730253151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56700, while the sum is 37.
The spelling of 1360730253151 in words is "one trillion, three hundred sixty billion, seven hundred thirty million, two hundred fifty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •