Base | Representation |
---|---|
bin | 1010010001110111011001… |
… | …0001101011000010111101 |
3 | 1111000110112211102002202101 |
4 | 2210131312101223002331 |
5 | 2440133041041100104 |
6 | 40012030443425101 |
7 | 2244355111651636 |
oct | 244356621530275 |
9 | 44013484362671 |
10 | 11302043300029 |
11 | 3668195887819 |
12 | 13264b3525191 |
13 | 63ca1667a921 |
14 | 2b1043c0488d |
15 | 148ed34305a4 |
hex | a477646b0bd |
11302043300029 has 2 divisors, whose sum is σ = 11302043300030. Its totient is φ = 11302043300028.
The previous prime is 11302043299969. The next prime is 11302043300033. The reversal of 11302043300029 is 92000334020311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8926739695225 + 2375303604804 = 2987765^2 + 1541202^2 .
It is a cyclic number.
It is not a de Polignac number, because 11302043300029 - 27 = 11302043299901 is a prime.
It is a super-2 number, since 2×113020433000292 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11302043300099) 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, 5651021650014 + 5651021650015.
It is an arithmetic number, because the mean of its divisors is an integer number (5651021650015).
Almost surely, 211302043300029 is an apocalyptic number.
It is an amenable number.
11302043300029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11302043300029 is an equidigital number, since it uses as much as digits as its factorization.
11302043300029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 11302043300029 in words is "eleven trillion, three hundred two billion, forty-three million, three hundred thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •