Base | Representation |
---|---|
bin | 1010000110101100011101… |
… | …1110001100111111110001 |
3 | 1110100010012012110111201112 |
4 | 2201223013132030333301 |
5 | 2424012022243322433 |
6 | 35343531342443105 |
7 | 2224452266631431 |
oct | 241530736147761 |
9 | 43303165414645 |
10 | 11110132010993 |
11 | 35a3864974914 |
12 | 12b5274893495 |
13 | 6278b1091b72 |
14 | 2a5a3a0c02c1 |
15 | 14400017b348 |
hex | a1ac778cff1 |
11110132010993 has 2 divisors, whose sum is σ = 11110132010994. Its totient is φ = 11110132010992.
The previous prime is 11110132010953. The next prime is 11110132011029. The reversal of 11110132010993 is 39901023101111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10821652378384 + 288479632609 = 3289628^2 + 537103^2 .
It is a cyclic number.
It is not a de Polignac number, because 11110132010993 - 214 = 11110131994609 is a prime.
It is not a weakly prime, because it can be changed into another prime (11110132010953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555066005496 + 5555066005497.
It is an arithmetic number, because the mean of its divisors is an integer number (5555066005497).
Almost surely, 211110132010993 is an apocalyptic number.
It is an amenable number.
11110132010993 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110132010993 is an equidigital number, since it uses as much as digits as its factorization.
11110132010993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 32.
The spelling of 11110132010993 in words is "eleven trillion, one hundred ten billion, one hundred thirty-two million, ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •