Base | Representation |
---|---|
bin | 1010010011000101100010… |
… | …0101100000110110011101 |
3 | 1111002110200201210221111102 |
4 | 2210301120211200312131 |
5 | 2441004021111134044 |
6 | 40025420143402445 |
7 | 2246026664103164 |
oct | 244613045406635 |
9 | 44073621727442 |
10 | 11323020021149 |
11 | 367607a67a881 |
12 | 132a5885b3425 |
13 | 6419aa501a45 |
14 | 2b2073ad83db |
15 | 14980ecd024e |
hex | a4c58960d9d |
11323020021149 has 2 divisors, whose sum is σ = 11323020021150. Its totient is φ = 11323020021148.
The previous prime is 11323020021101. The next prime is 11323020021197. The reversal of 11323020021149 is 94112002032311.
It is a balanced prime because it is at equal distance from previous prime (11323020021101) and next prime (11323020021197).
It can be written as a sum of positive squares in only one way, i.e., 6097763503225 + 5225256517924 = 2469365^2 + 2285882^2 .
It is a cyclic number.
It is not a de Polignac number, because 11323020021149 - 228 = 11322751585693 is a prime.
It is a super-2 number, since 2×113230200211492 (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 (11323020021449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661510010574 + 5661510010575.
It is an arithmetic number, because the mean of its divisors is an integer number (5661510010575).
Almost surely, 211323020021149 is an apocalyptic number.
It is an amenable number.
11323020021149 is a deficient number, since it is larger than the sum of its proper divisors (1).
11323020021149 is an equidigital number, since it uses as much as digits as its factorization.
11323020021149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 11323020021149 in words is "eleven trillion, three hundred twenty-three billion, twenty million, twenty-one thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •