Base | Representation |
---|---|
bin | 110010111101101111101011… |
… | …101110110110101000010101 |
3 | 1002101122002111020101102111002 |
4 | 302331233223232312220111 |
5 | 213334344301240021001 |
6 | 2112414551543153045 |
7 | 65132654202235265 |
oct | 6275575356665025 |
9 | 1071562436342432 |
10 | 224145413204501 |
11 | 65468599327818 |
12 | 21180a71445785 |
13 | 980ba8b5747c9 |
14 | 3d4c9a57117a5 |
15 | 1ada80ae7946b |
hex | cbdbebbb6a15 |
224145413204501 has 8 divisors (see below), whose sum is σ = 224822329510464. Its totient is φ = 223469414753440.
The previous prime is 224145413204491. The next prime is 224145413204527. The reversal of 224145413204501 is 105402314541422.
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 224145413204501 - 230 = 224144339462677 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 (224145413204201) 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, 228974576 + ... + 229951401.
It is an arithmetic number, because the mean of its divisors is an integer number (28102791188808).
Almost surely, 2224145413204501 is an apocalyptic number.
It is an amenable number.
224145413204501 is a deficient number, since it is larger than the sum of its proper divisors (676916305963).
224145413204501 is an equidigital number, since it uses as much as digits as its factorization.
224145413204501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458927451.
The product of its (nonzero) digits is 153600, while the sum is 38.
Adding to 224145413204501 its reverse (105402314541422), we get a palindrome (329547727745923).
The spelling of 224145413204501 in words is "two hundred twenty-four trillion, one hundred forty-five billion, four hundred thirteen million, two hundred four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •