Base | Representation |
---|---|
bin | 1010010001110111011001… |
… | …0001101011000000111101 |
3 | 1111000110112211102002120122 |
4 | 2210131312101223000331 |
5 | 2440133041041044101 |
6 | 40012030443424325 |
7 | 2244355111651364 |
oct | 244356621530075 |
9 | 44013484362518 |
10 | 11302043299901 |
11 | 3668195887712 |
12 | 13264b35250a5 |
13 | 63ca1667a853 |
14 | 2b1043c047db |
15 | 148ed343051b |
hex | a477646b03d |
11302043299901 has 2 divisors, whose sum is σ = 11302043299902. Its totient is φ = 11302043299900.
The previous prime is 11302043299849. The next prime is 11302043299909. The reversal of 11302043299901 is 10999234020311.
11302043299901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10228809459001 + 1073233840900 = 3198251^2 + 1035970^2 .
It is a cyclic number.
It is not a de Polignac number, because 11302043299901 - 234 = 11284863430717 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11302043299909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5651021649950 + 5651021649951.
It is an arithmetic number, because the mean of its divisors is an integer number (5651021649951).
Almost surely, 211302043299901 is an apocalyptic number.
It is an amenable number.
11302043299901 is a deficient number, since it is larger than the sum of its proper divisors (1).
11302043299901 is an equidigital number, since it uses as much as digits as its factorization.
11302043299901 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 104976, while the sum is 44.
The spelling of 11302043299901 in words is "eleven trillion, three hundred two billion, forty-three million, two hundred ninety-nine thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •