Base | Representation |
---|---|
bin | 11101111110111011111… |
… | …01010001100011011001 |
3 | 10122111011212120212011201 |
4 | 32333131331101203121 |
5 | 113334343034324121 |
6 | 2105135455354201 |
7 | 134300560052206 |
oct | 16773575214331 |
9 | 3574155525151 |
10 | 1030221011161 |
11 | 367a069a2981 |
12 | 1477b6b22961 |
13 | 761c3393674 |
14 | 37c11d82cad |
15 | 1bbe9999e91 |
hex | efddf518d9 |
1030221011161 has 2 divisors, whose sum is σ = 1030221011162. Its totient is φ = 1030221011160.
The previous prime is 1030221011129. The next prime is 1030221011191. The reversal of 1030221011161 is 1611101220301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 540982315225 + 489238695936 = 735515^2 + 699456^2 .
It is an emirp because it is prime and its reverse (1611101220301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1030221011161 - 25 = 1030221011129 is a prime.
It is a super-2 number, since 2×10302210111612 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1030221011191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515110505580 + 515110505581.
It is an arithmetic number, because the mean of its divisors is an integer number (515110505581).
Almost surely, 21030221011161 is an apocalyptic number.
It is an amenable number.
1030221011161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030221011161 is an equidigital number, since it uses as much as digits as its factorization.
1030221011161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1030221011161 its reverse (1611101220301), we get a palindrome (2641322231462).
The spelling of 1030221011161 in words is "one trillion, thirty billion, two hundred twenty-one million, eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •