Base | Representation |
---|---|
bin | 1100110101010010110… |
… | …0010101011011000011 |
3 | 210002001112100210202012 |
4 | 3031110230111123003 |
5 | 12103002321142243 |
6 | 245140241443135 |
7 | 21633211060145 |
oct | 3152454253303 |
9 | 702045323665 |
10 | 220464240323 |
11 | 85553352908 |
12 | 368890404ab |
13 | 17a35c3b412 |
14 | a955cd0c95 |
15 | 5b04d42d18 |
hex | 3354b156c3 |
220464240323 has 2 divisors, whose sum is σ = 220464240324. Its totient is φ = 220464240322.
The previous prime is 220464240317. The next prime is 220464240331. The reversal of 220464240323 is 323042464022.
220464240323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220464240323 is a prime.
It is a super-2 number, since 2×2204642403232 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 220464240323.
It is not a weakly prime, because it can be changed into another prime (220464240023) 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, 110232120161 + 110232120162.
It is an arithmetic number, because the mean of its divisors is an integer number (110232120162).
Almost surely, 2220464240323 is an apocalyptic number.
220464240323 is a deficient number, since it is larger than the sum of its proper divisors (1).
220464240323 is an equidigital number, since it uses as much as digits as its factorization.
220464240323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 32.
The spelling of 220464240323 in words is "two hundred twenty billion, four hundred sixty-four million, two hundred forty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •