Base | Representation |
---|---|
bin | 10011010110110111010… |
… | …011011100011100000101 |
3 | 11201011112100000210200112 |
4 | 103112313103130130011 |
5 | 133243242334102323 |
6 | 2455032243522405 |
7 | 165051045220451 |
oct | 23266723343405 |
9 | 4634470023615 |
10 | 1330220222213 |
11 | 473163700453 |
12 | 195980089405 |
13 | 98592ca712c |
14 | 48550d5b661 |
15 | 24907050178 |
hex | 135b74dc705 |
1330220222213 has 2 divisors, whose sum is σ = 1330220222214. Its totient is φ = 1330220222212.
The previous prime is 1330220222209. The next prime is 1330220222231. The reversal of 1330220222213 is 3122220220331.
Together with next prime (1330220222231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1304970376609 + 25249845604 = 1142353^2 + 158902^2 .
It is a cyclic number.
It is not a de Polignac number, because 1330220222213 - 22 = 1330220222209 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1330220222203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665110111106 + 665110111107.
It is an arithmetic number, because the mean of its divisors is an integer number (665110111107).
Almost surely, 21330220222213 is an apocalyptic number.
It is an amenable number.
1330220222213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330220222213 is an equidigital number, since it uses as much as digits as its factorization.
1330220222213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 1330220222213 its reverse (3122220220331), we get a palindrome (4452440442544).
The spelling of 1330220222213 in words is "one trillion, three hundred thirty billion, two hundred twenty million, two hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •