Base | Representation |
---|---|
bin | 1100110011100100110… |
… | …0110101111110011111 |
3 | 210000212101110101021112 |
4 | 3030321030311332133 |
5 | 12101031232001343 |
6 | 245022403452235 |
7 | 21615610434626 |
oct | 3147114657637 |
9 | 700771411245 |
10 | 220003000223 |
11 | 85336a5a346 |
12 | 3677a68707b |
13 | 17991507596 |
14 | a9109486bd |
15 | 5ac95d4218 |
hex | 3339335f9f |
220003000223 has 8 divisors (see below), whose sum is σ = 223505390640. Its totient is φ = 216507044160.
The previous prime is 220003000213. The next prime is 220003000271. The reversal of 220003000223 is 322000300022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220003000223 - 24 = 220003000207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220003000198 and 220003000207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220003000213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1539638 + ... + 1676451.
It is an arithmetic number, because the mean of its divisors is an integer number (27938173830).
Almost surely, 2220003000223 is an apocalyptic number.
220003000223 is a deficient number, since it is larger than the sum of its proper divisors (3502390417).
220003000223 is a wasteful number, since it uses less digits than its factorization.
220003000223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3217177.
The product of its (nonzero) digits is 144, while the sum is 14.
Adding to 220003000223 its reverse (322000300022), we get a palindrome (542003300245).
It can be divided in two parts, 22000300022 and 3, that multiplied together give a palindrome (66000900066).
The spelling of 220003000223 in words is "two hundred twenty billion, three million, two hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •