Base | Representation |
---|---|
bin | 11101011011101111111… |
… | …10010100110000100101 |
3 | 10120200102100002020100002 |
4 | 32231313332110300211 |
5 | 113032201004004341 |
6 | 2052333150431045 |
7 | 133031463235511 |
oct | 16556776246045 |
9 | 3520370066302 |
10 | 1011330141221 |
11 | 35a9a2554774 |
12 | 144004502485 |
13 | 744a271530a |
14 | 36d3d0d5141 |
15 | 1b4912ba29b |
hex | eb77f94c25 |
1011330141221 has 2 divisors, whose sum is σ = 1011330141222. Its totient is φ = 1011330141220.
The previous prime is 1011330141209. The next prime is 1011330141271. The reversal of 1011330141221 is 1221410331101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 675207324100 + 336122817121 = 821710^2 + 579761^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011330141221 - 238 = 736452234277 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1011330141193 and 1011330141202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011330141271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505665070610 + 505665070611.
It is an arithmetic number, because the mean of its divisors is an integer number (505665070611).
Almost surely, 21011330141221 is an apocalyptic number.
It is an amenable number.
1011330141221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011330141221 is an equidigital number, since it uses as much as digits as its factorization.
1011330141221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1011330141221 its reverse (1221410331101), we get a palindrome (2232740472322).
The spelling of 1011330141221 in words is "one trillion, eleven billion, three hundred thirty million, one hundred forty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •