Base | Representation |
---|---|
bin | 1010000001001010101011… |
… | …11111101010011010101001 |
3 | 2220000002010120120200012201 |
4 | 11000211111333222122221 |
5 | 10341421103440411403 |
6 | 114504332140340201 |
7 | 4432432054260604 |
oct | 500452577523251 |
9 | 86002116520181 |
10 | 22030330013353 |
11 | 7024012a65862 |
12 | 2579760b44661 |
13 | c3a5b33b906c |
14 | 5623b8cdd33b |
15 | 2830d592921d |
hex | 140955fea6a9 |
22030330013353 has 2 divisors, whose sum is σ = 22030330013354. Its totient is φ = 22030330013352.
The previous prime is 22030330013233. The next prime is 22030330013371. The reversal of 22030330013353 is 35331003303022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13409453019664 + 8620876993689 = 3661892^2 + 2936133^2 .
It is a cyclic number.
It is not a de Polignac number, because 22030330013353 - 237 = 21892891059881 is a prime.
It is not a weakly prime, because it can be changed into another prime (22030330013383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11015165006676 + 11015165006677.
It is an arithmetic number, because the mean of its divisors is an integer number (11015165006677).
Almost surely, 222030330013353 is an apocalyptic number.
It is an amenable number.
22030330013353 is a deficient number, since it is larger than the sum of its proper divisors (1).
22030330013353 is an equidigital number, since it uses as much as digits as its factorization.
22030330013353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 28.
Adding to 22030330013353 its reverse (35331003303022), we get a palindrome (57361333316375).
The spelling of 22030330013353 in words is "twenty-two trillion, thirty billion, three hundred thirty million, thirteen thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •