Base | Representation |
---|---|
bin | 1010010001110111011001… |
… | …0001101011000010000001 |
3 | 1111000110112211102002200011 |
4 | 2210131312101223002001 |
5 | 2440133041041044334 |
6 | 40012030443424521 |
7 | 2244355111651522 |
oct | 244356621530201 |
9 | 44013484362604 |
10 | 11302043299969 |
11 | 3668195887774 |
12 | 13264b3525141 |
13 | 63ca1667a8a6 |
14 | 2b1043c04849 |
15 | 148ed3430564 |
hex | a477646b081 |
11302043299969 has 2 divisors, whose sum is σ = 11302043299970. Its totient is φ = 11302043299968.
The previous prime is 11302043299961. The next prime is 11302043300029. The reversal of 11302043299969 is 96999234020311.
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., 9908569292944 + 1393474007025 = 3147788^2 + 1180455^2 .
It is a cyclic number.
It is not a de Polignac number, because 11302043299969 - 23 = 11302043299961 is a prime.
It is a super-2 number, since 2×113020432999692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11302043299961) 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, 5651021649984 + 5651021649985.
It is an arithmetic number, because the mean of its divisors is an integer number (5651021649985).
Almost surely, 211302043299969 is an apocalyptic number.
It is an amenable number.
11302043299969 is a deficient number, since it is larger than the sum of its proper divisors (1).
11302043299969 is an equidigital number, since it uses as much as digits as its factorization.
11302043299969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5668704, while the sum is 58.
The spelling of 11302043299969 in words is "eleven trillion, three hundred two billion, forty-three million, two hundred ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •