Base | Representation |
---|---|
bin | 111101011110110111010… |
… | …011100010101010100111 |
3 | 112221220112110221221112101 |
4 | 331132313103202222213 |
5 | 1023210324210031343 |
6 | 12552541241232531 |
7 | 614151065123350 |
oct | 75366723425247 |
9 | 15856473857471 |
10 | 4225028205223 |
11 | 13899083038a1 |
12 | 582a09492747 |
13 | 2485594481a7 |
14 | 1086c742ad27 |
15 | 74d81823e4d |
hex | 3d7b74e2aa7 |
4225028205223 has 8 divisors (see below), whose sum is σ = 4828624846848. Its totient is φ = 3621436859544.
The previous prime is 4225028205193. The next prime is 4225028205253. The reversal of 4225028205223 is 3225028205224.
It is an interprime number because it is at equal distance from previous prime (4225028205193) and next prime (4225028205253).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4225028205223 - 25 = 4225028205191 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 (4225028205253) 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, 565290 + ... + 2961352.
It is an arithmetic number, because the mean of its divisors is an integer number (603578105856).
Almost surely, 24225028205223 is an apocalyptic number.
4225028205223 is a deficient number, since it is larger than the sum of its proper divisors (603596641625).
4225028205223 is a wasteful number, since it uses less digits than its factorization.
4225028205223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2647973.
The product of its (nonzero) digits is 153600, while the sum is 37.
Subtracting from 4225028205223 its reverse (3225028205224), we obtain a palindrome (999999999999).
The spelling of 4225028205223 in words is "four trillion, two hundred twenty-five billion, twenty-eight million, two hundred five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •