Base | Representation |
---|---|
bin | 1010011010100000000101… |
… | …0010001011010001010011 |
3 | 1111112122111100220111010002 |
4 | 2212220001102023101103 |
5 | 3000100412003244412 |
6 | 40204124304000215 |
7 | 2261156460052166 |
oct | 246500122132123 |
9 | 44478440814102 |
10 | 11450404353107 |
11 | 37150a8822885 |
12 | 134b1b930006b |
13 | 6509cb508bb5 |
14 | 2b82b9a43add |
15 | 14ccb81badc2 |
hex | a6a0148b453 |
11450404353107 has 2 divisors, whose sum is σ = 11450404353108. Its totient is φ = 11450404353106.
The previous prime is 11450404352963. The next prime is 11450404353139. The reversal of 11450404353107 is 70135340405411.
It is a strong prime.
It is an emirp because it is prime and its reverse (70135340405411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11450404353107 - 210 = 11450404352083 is a prime.
It is a super-2 number, since 2×114504043531072 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11450404353407) 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, 5725202176553 + 5725202176554.
It is an arithmetic number, because the mean of its divisors is an integer number (5725202176554).
Almost surely, 211450404353107 is an apocalyptic number.
11450404353107 is a deficient number, since it is larger than the sum of its proper divisors (1).
11450404353107 is an equidigital number, since it uses as much as digits as its factorization.
11450404353107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 38.
Adding to 11450404353107 its reverse (70135340405411), we get a palindrome (81585744758518).
The spelling of 11450404353107 in words is "eleven trillion, four hundred fifty billion, four hundred four million, three hundred fifty-three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •