Base | Representation |
---|---|
bin | 1010011001001110110010… |
… | …1100001000111010101111 |
3 | 1111110120011200001202111022 |
4 | 2212103230230020322233 |
5 | 2444221220001014244 |
6 | 40150115150044355 |
7 | 2256454652114651 |
oct | 246235454107257 |
9 | 44416150052438 |
10 | 11428584001199 |
11 | 37069207a94a2 |
12 | 1346b297a96bb |
13 | 64b931966871 |
14 | 2b7209aa86d1 |
15 | 14c43c7266ee |
hex | a64ecb08eaf |
11428584001199 has 2 divisors, whose sum is σ = 11428584001200. Its totient is φ = 11428584001198.
The previous prime is 11428584001067. The next prime is 11428584001217. The reversal of 11428584001199 is 99110048582411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11428584001199 - 220 = 11428582952623 is a prime.
It is a super-2 number, since 2×114285840011992 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11428584001199.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11428584000199) 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, 5714292000599 + 5714292000600.
It is an arithmetic number, because the mean of its divisors is an integer number (5714292000600).
Almost surely, 211428584001199 is an apocalyptic number.
11428584001199 is a deficient number, since it is larger than the sum of its proper divisors (1).
11428584001199 is an equidigital number, since it uses as much as digits as its factorization.
11428584001199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 829440, while the sum is 53.
The spelling of 11428584001199 in words is "eleven trillion, four hundred twenty-eight billion, five hundred eighty-four million, one thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •