Base | Representation |
---|---|
bin | 10000011100100110011… |
… | …110110110101001011101 |
3 | 11000001022010010111221202 |
4 | 100130212132312221131 |
5 | 122004143314134323 |
6 | 2223114500205245 |
7 | 144440645445365 |
oct | 20344636665135 |
9 | 4001263114852 |
10 | 1130222021213 |
11 | 3a636295892a |
12 | 163065099825 |
13 | 8276c167a6c |
14 | 3c9bb1c79a5 |
15 | 1e5edd33d28 |
hex | 107267b6a5d |
1130222021213 has 2 divisors, whose sum is σ = 1130222021214. Its totient is φ = 1130222021212.
The previous prime is 1130222021183. The next prime is 1130222021233. The reversal of 1130222021213 is 3121202220311.
It is an a-pointer prime, because the next prime (1130222021233) can be obtained adding 1130222021213 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1092165034489 + 38056986724 = 1045067^2 + 195082^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130222021213 - 214 = 1130222004829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130222021233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565111010606 + 565111010607.
It is an arithmetic number, because the mean of its divisors is an integer number (565111010607).
Almost surely, 21130222021213 is an apocalyptic number.
It is an amenable number.
1130222021213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130222021213 is an equidigital number, since it uses as much as digits as its factorization.
1130222021213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1130222021213 its reverse (3121202220311), we get a palindrome (4251424241524).
The spelling of 1130222021213 in words is "one trillion, one hundred thirty billion, two hundred twenty-two million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •