Base | Representation |
---|---|
bin | 1010000010100111101110… |
… | …1011110101101011011111 |
3 | 1110002102112102002210210121 |
4 | 2200221323223311223133 |
5 | 2421340202101242401 |
6 | 35251434253215411 |
7 | 2216423662326433 |
oct | 240517353655337 |
9 | 43072472083717 |
10 | 11040141040351 |
11 | 357710888a725 |
12 | 12a37a0a91567 |
13 | 621108789337 |
14 | 2a24ba7789c3 |
15 | 1422a5750ca1 |
hex | a0a7baf5adf |
11040141040351 has 2 divisors, whose sum is σ = 11040141040352. Its totient is φ = 11040141040350.
The previous prime is 11040141040333. The next prime is 11040141040367. The reversal of 11040141040351 is 15304014104011.
It is a strong prime.
It is an emirp because it is prime and its reverse (15304014104011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11040141040351 - 27 = 11040141040223 is a prime.
It is a super-2 number, since 2×110401410403512 (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 (11040141070351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5520070520175 + 5520070520176.
It is an arithmetic number, because the mean of its divisors is an integer number (5520070520176).
Almost surely, 211040141040351 is an apocalyptic number.
11040141040351 is a deficient number, since it is larger than the sum of its proper divisors (1).
11040141040351 is an equidigital number, since it uses as much as digits as its factorization.
11040141040351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 11040141040351 its reverse (15304014104011), we get a palindrome (26344155144362).
The spelling of 11040141040351 in words is "eleven trillion, forty billion, one hundred forty-one million, forty thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •