Base | Representation |
---|---|
bin | 10011010110110000001… |
… | …101011111111100000001 |
3 | 11201011020001010000200112 |
4 | 103112300031133330001 |
5 | 133243021403120134 |
6 | 2455012353201105 |
7 | 165045101565455 |
oct | 23266015377401 |
9 | 4634201100615 |
10 | 1330101223169 |
11 | 473102512734 |
12 | 195948260195 |
13 | 985744409b4 |
14 | 4853d222665 |
15 | 248eb8961ce |
hex | 135b035ff01 |
1330101223169 has 2 divisors, whose sum is σ = 1330101223170. Its totient is φ = 1330101223168.
The previous prime is 1330101223117. The next prime is 1330101223183. The reversal of 1330101223169 is 9613221010331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1125243600625 + 204857622544 = 1060775^2 + 452612^2 .
It is a cyclic number.
It is not a de Polignac number, because 1330101223169 - 216 = 1330101157633 is a prime.
It is a super-2 number, since 2×13301012231692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1330101220169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665050611584 + 665050611585.
It is an arithmetic number, because the mean of its divisors is an integer number (665050611585).
Almost surely, 21330101223169 is an apocalyptic number.
It is an amenable number.
1330101223169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330101223169 is an equidigital number, since it uses as much as digits as its factorization.
1330101223169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 1330101223169 in words is "one trillion, three hundred thirty billion, one hundred one million, two hundred twenty-three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •