Base | Representation |
---|---|
bin | 1101000010100011101… |
… | …1111110111010101011 |
3 | 210102020200202211201002 |
4 | 3100220323332322223 |
5 | 12132300412042420 |
6 | 250525443345215 |
7 | 22120360015001 |
oct | 3205073767253 |
9 | 712220684632 |
10 | 224025112235 |
11 | 87010376661 |
12 | 3750168220b |
13 | 1818289b812 |
14 | abb2bb6a71 |
15 | 5c62776075 |
hex | 3428efeeab |
224025112235 has 4 divisors (see below), whose sum is σ = 268830134688. Its totient is φ = 179220089784.
The previous prime is 224025112229. The next prime is 224025112237. The reversal of 224025112235 is 532211520422.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 224025112235 - 24 = 224025112219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 224025112198 and 224025112207.
It is not an unprimeable number, because it can be changed into a prime (224025112237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22402511219 + ... + 22402511228.
It is an arithmetic number, because the mean of its divisors is an integer number (67207533672).
Almost surely, 2224025112235 is an apocalyptic number.
224025112235 is a deficient number, since it is larger than the sum of its proper divisors (44805022453).
224025112235 is an equidigital number, since it uses as much as digits as its factorization.
224025112235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44805022452.
The product of its (nonzero) digits is 9600, while the sum is 29.
Adding to 224025112235 its reverse (532211520422), we get a palindrome (756236632657).
The spelling of 224025112235 in words is "two hundred twenty-four billion, twenty-five million, one hundred twelve thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •