Base | Representation |
---|---|
bin | 1010010011000001011001… |
… | …1111110000000110001001 |
3 | 1111002100211110101201200111 |
4 | 2210300112133300012021 |
5 | 2440444233232330343 |
6 | 40025114134034321 |
7 | 2245660341310516 |
oct | 244602637600611 |
9 | 44070743351614 |
10 | 11321911214473 |
11 | 367566079aa22 |
12 | 132a3191a89a1 |
13 | 641861889712 |
14 | 2b1daa74630d |
15 | 1497977a9c9d |
hex | a4c167f0189 |
11321911214473 has 2 divisors, whose sum is σ = 11321911214474. Its totient is φ = 11321911214472.
The previous prime is 11321911214417. The next prime is 11321911214597. The reversal of 11321911214473 is 37441211912311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8722825554249 + 2599085660224 = 2953443^2 + 1612168^2 .
It is an emirp because it is prime and its reverse (37441211912311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11321911214473 - 29 = 11321911213961 is a prime.
It is not a weakly prime, because it can be changed into another prime (11321911211473) 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, 5660955607236 + 5660955607237.
It is an arithmetic number, because the mean of its divisors is an integer number (5660955607237).
Almost surely, 211321911214473 is an apocalyptic number.
It is an amenable number.
11321911214473 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321911214473 is an equidigital number, since it uses as much as digits as its factorization.
11321911214473 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36288, while the sum is 40.
The spelling of 11321911214473 in words is "eleven trillion, three hundred twenty-one billion, nine hundred eleven million, two hundred fourteen thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •