Base | Representation |
---|---|
bin | 1010001111000100000000… |
… | …1011000001011011100111 |
3 | 1110211212021000021010000002 |
4 | 2203301000023001123213 |
5 | 2433340432040244131 |
6 | 35533544403411515 |
7 | 2241031623500303 |
oct | 243610013013347 |
9 | 43755230233002 |
10 | 11253890946791 |
11 | 3649826062069 |
12 | 13190b5383b9b |
13 | 63831164120c |
14 | 2ac996a30d03 |
15 | 147b15da66cb |
hex | a3c402c16e7 |
11253890946791 has 2 divisors, whose sum is σ = 11253890946792. Its totient is φ = 11253890946790.
The previous prime is 11253890946743. The next prime is 11253890946833. The reversal of 11253890946791 is 19764909835211.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11253890946791 is a prime.
It is a super-2 number, since 2×112538909467912 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11253890946721) 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, 5626945473395 + 5626945473396.
It is an arithmetic number, because the mean of its divisors is an integer number (5626945473396).
It is a 1-persistent number, because it is pandigital, but 2⋅11253890946791 = 22507781893582 is not.
Almost surely, 211253890946791 is an apocalyptic number.
11253890946791 is a deficient number, since it is larger than the sum of its proper divisors (1).
11253890946791 is an equidigital number, since it uses as much as digits as its factorization.
11253890946791 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29393280, while the sum is 65.
The spelling of 11253890946791 in words is "eleven trillion, two hundred fifty-three billion, eight hundred ninety million, nine hundred forty-six thousand, seven hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •