Base | Representation |
---|---|
bin | 1010011010101101111110… |
… | …0101101010001010010001 |
3 | 1111120000010021220022000011 |
4 | 2212223133211222022101 |
5 | 3000131031301033241 |
6 | 40205542335154521 |
7 | 2261351055414103 |
oct | 246533745521221 |
9 | 44500107808004 |
10 | 11454134002321 |
11 | 37167420434aa |
12 | 134ba7a375a41 |
13 | 651174110c1a |
14 | 2b8551101573 |
15 | 14ce3583c281 |
hex | a6adf96a291 |
11454134002321 has 2 divisors, whose sum is σ = 11454134002322. Its totient is φ = 11454134002320.
The previous prime is 11454134002309. The next prime is 11454134002379. The reversal of 11454134002321 is 12320043145411.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10809267185025 + 644866817296 = 3287745^2 + 803036^2 .
It is a cyclic number.
It is not a de Polignac number, because 11454134002321 - 27 = 11454134002193 is a prime.
It is not a weakly prime, because it can be changed into another prime (11454134002391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5727067001160 + 5727067001161.
It is an arithmetic number, because the mean of its divisors is an integer number (5727067001161).
Almost surely, 211454134002321 is an apocalyptic number.
It is an amenable number.
11454134002321 is a deficient number, since it is larger than the sum of its proper divisors (1).
11454134002321 is an equidigital number, since it uses as much as digits as its factorization.
11454134002321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 11454134002321 its reverse (12320043145411), we get a palindrome (23774177147732).
The spelling of 11454134002321 in words is "eleven trillion, four hundred fifty-four billion, one hundred thirty-four million, two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •