Base | Representation |
---|---|
bin | 110010000101110101010000… |
… | …001010000000001101101011 |
3 | 1001220000202210222120102210201 |
4 | 302011311100022000031223 |
5 | 212333421223143011243 |
6 | 2100313503102053031 |
7 | 64255242150443251 |
oct | 6205652012001553 |
9 | 1056022728512721 |
10 | 220303102313323 |
11 | 64217025a69597 |
12 | 2086027327a177 |
13 | 95c0655029473 |
14 | 3c58a270205d1 |
15 | 1a708c8b3804d |
hex | c85d5028036b |
220303102313323 has 2 divisors, whose sum is σ = 220303102313324. Its totient is φ = 220303102313322.
The previous prime is 220303102313317. The next prime is 220303102313443. The reversal of 220303102313323 is 323313201303022.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 220303102313323 - 225 = 220303068758891 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220303102313291 and 220303102313300.
It is not a weakly prime, because it can be changed into another prime (220303102313023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110151551156661 + 110151551156662.
It is an arithmetic number, because the mean of its divisors is an integer number (110151551156662).
Almost surely, 2220303102313323 is an apocalyptic number.
220303102313323 is a deficient number, since it is larger than the sum of its proper divisors (1).
220303102313323 is an equidigital number, since it uses as much as digits as its factorization.
220303102313323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 220303102313323 its reverse (323313201303022), we get a palindrome (543616303616345).
The spelling of 220303102313323 in words is "two hundred twenty trillion, three hundred three billion, one hundred two million, three hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •