Base | Representation |
---|---|
bin | 101110111010111101011… |
… | …110101110011001111111 |
3 | 102102020202021202221220012 |
4 | 232322331132232121333 |
5 | 410312040012421343 |
6 | 10505134305013435 |
7 | 451645514233220 |
oct | 56727536563177 |
9 | 12366667687805 |
10 | 3224404420223 |
11 | 103350a265008 |
12 | 440ab262427b |
13 | 1a50a1b768cc |
14 | b20c2209247 |
15 | 58d1a442718 |
hex | 2eebd7ae67f |
3224404420223 has 4 divisors (see below), whose sum is σ = 3685033623120. Its totient is φ = 2763775217328.
The previous prime is 3224404420187. The next prime is 3224404420231. The reversal of 3224404420223 is 3220244044223.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3224404420223 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3224404420223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3224404420283) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 230314601438 + ... + 230314601451.
It is an arithmetic number, because the mean of its divisors is an integer number (921258405780).
Almost surely, 23224404420223 is an apocalyptic number.
3224404420223 is a deficient number, since it is larger than the sum of its proper divisors (460629202897).
3224404420223 is an equidigital number, since it uses as much as digits as its factorization.
3224404420223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 460629202896.
The product of its (nonzero) digits is 73728, while the sum is 32.
Adding to 3224404420223 its reverse (3220244044223), we get a palindrome (6444648464446).
The spelling of 3224404420223 in words is "three trillion, two hundred twenty-four billion, four hundred four million, four hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •