Base | Representation |
---|---|
bin | 1010001101101011011011… |
… | …0101100011001111001101 |
3 | 1110202120212210222121102222 |
4 | 2203122312311203033031 |
5 | 2432443232133044041 |
6 | 35515013042225125 |
7 | 2236230434012522 |
oct | 243326665431715 |
9 | 43676783877388 |
10 | 11230112003021 |
11 | 363a73350371a |
12 | 13145799551a5 |
13 | 635cc20922a2 |
14 | 2ab77c8d9149 |
15 | 1471c34cd74b |
hex | a36b6d633cd |
11230112003021 has 2 divisors, whose sum is σ = 11230112003022. Its totient is φ = 11230112003020.
The previous prime is 11230112002997. The next prime is 11230112003039. The reversal of 11230112003021 is 12030021103211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10614335941225 + 615776061796 = 3257965^2 + 784714^2 .
It is a cyclic number.
It is not a de Polignac number, because 11230112003021 - 214 = 11230111986637 is a prime.
It is a super-2 number, since 2×112301120030212 (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 (11230112003041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615056001510 + 5615056001511.
It is an arithmetic number, because the mean of its divisors is an integer number (5615056001511).
Almost surely, 211230112003021 is an apocalyptic number.
It is an amenable number.
11230112003021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11230112003021 is an equidigital number, since it uses as much as digits as its factorization.
11230112003021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11230112003021 its reverse (12030021103211), we get a palindrome (23260133106232).
The spelling of 11230112003021 in words is "eleven trillion, two hundred thirty billion, one hundred twelve million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •