Base | Representation |
---|---|
bin | 1100111100001001011… |
… | …0100100110101000111 |
3 | 210020210202020210202110 |
4 | 3033002112210311013 |
5 | 12120234312430043 |
6 | 250043002512103 |
7 | 22026621035415 |
oct | 3170226446507 |
9 | 706722223673 |
10 | 222304030023 |
11 | 86307914069 |
12 | 37101205633 |
13 | 17c6a15038a |
14 | aa8c3a42b5 |
15 | 5bb160ab33 |
hex | 33c25a4d47 |
222304030023 has 4 divisors (see below), whose sum is σ = 296405373368. Its totient is φ = 148202686680.
The previous prime is 222304030019. The next prime is 222304030057. The reversal of 222304030023 is 320030403222.
222304030023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 222304030023 - 22 = 222304030019 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222304030423) 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 in 3 ways as a sum of consecutive naturals, for example, 37050671668 + ... + 37050671673.
It is an arithmetic number, because the mean of its divisors is an integer number (74101343342).
Almost surely, 2222304030023 is an apocalyptic number.
222304030023 is a deficient number, since it is larger than the sum of its proper divisors (74101343345).
222304030023 is an equidigital number, since it uses as much as digits as its factorization.
222304030023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74101343344.
The product of its (nonzero) digits is 1728, while the sum is 21.
Adding to 222304030023 its reverse (320030403222), we get a palindrome (542334433245).
The spelling of 222304030023 in words is "two hundred twenty-two billion, three hundred four million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •