Base | Representation |
---|---|
bin | 10000110010101000010… |
… | …011000011001011100101 |
3 | 11002022100112000020120212 |
4 | 100302220103003023211 |
5 | 122401113422121011 |
6 | 2242025513305205 |
7 | 146236043661221 |
oct | 20625023031345 |
9 | 4068315006525 |
10 | 1153874801381 |
11 | 4053a0275735 |
12 | 167766405205 |
13 | 84a6b542483 |
14 | 3dbc267b781 |
15 | 200355da08b |
hex | 10ca84c32e5 |
1153874801381 has 2 divisors, whose sum is σ = 1153874801382. Its totient is φ = 1153874801380.
The previous prime is 1153874801353. The next prime is 1153874801393. The reversal of 1153874801381 is 1831084783511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 746746581025 + 407128220356 = 864145^2 + 638066^2 .
It is a cyclic number.
It is not a de Polignac number, because 1153874801381 - 222 = 1153870607077 is a prime.
It is a super-2 number, since 2×11538748013812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1153874801581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 576937400690 + 576937400691.
It is an arithmetic number, because the mean of its divisors is an integer number (576937400691).
Almost surely, 21153874801381 is an apocalyptic number.
It is an amenable number.
1153874801381 is a deficient number, since it is larger than the sum of its proper divisors (1).
1153874801381 is an equidigital number, since it uses as much as digits as its factorization.
1153874801381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 645120, while the sum is 50.
The spelling of 1153874801381 in words is "one trillion, one hundred fifty-three billion, eight hundred seventy-four million, eight hundred one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •