Base | Representation |
---|---|
bin | 1101000010100000111… |
… | …0111101110110111101 |
3 | 210102012212120022000220 |
4 | 3100220032331312331 |
5 | 12132234401431141 |
6 | 250524342411553 |
7 | 22120154505204 |
oct | 3205016756675 |
9 | 712185508026 |
10 | 224013311421 |
11 | 87004746519 |
12 | 374b9730bb9 |
13 | 181802c93a3 |
14 | abb13c423b |
15 | 5c616e4766 |
hex | 34283bddbd |
224013311421 has 8 divisors (see below), whose sum is σ = 316254086784. Its totient is φ = 140557371840.
The previous prime is 224013311419. The next prime is 224013311441. The reversal of 224013311421 is 124113310422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 224013311421 - 21 = 224013311419 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 224013311391 and 224013311400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (224013311441) 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, 2196208885 + ... + 2196208986.
It is an arithmetic number, because the mean of its divisors is an integer number (39531760848).
Almost surely, 2224013311421 is an apocalyptic number.
It is an amenable number.
224013311421 is a deficient number, since it is larger than the sum of its proper divisors (92240775363).
224013311421 is a wasteful number, since it uses less digits than its factorization.
224013311421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4392417891.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 224013311421 its reverse (124113310422), we get a palindrome (348126621843).
Subtracting from 224013311421 its reverse (124113310422), we obtain a palindrome (99900000999).
The spelling of 224013311421 in words is "two hundred twenty-four billion, thirteen million, three hundred eleven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •