Base | Representation |
---|---|
bin | 11010101101011… |
… | …00101100000101 |
3 | 120121121010100002 |
4 | 31112230230011 |
5 | 424324212041 |
6 | 34122131045 |
7 | 5360266502 |
oct | 1526545405 |
9 | 517533302 |
10 | 224054021 |
11 | 105522114 |
12 | 63050a85 |
13 | 37559a59 |
14 | 21a844a9 |
15 | 14a0b59b |
hex | d5acb05 |
224054021 has 2 divisors, whose sum is σ = 224054022. Its totient is φ = 224054020.
The previous prime is 224054003. The next prime is 224054071. The reversal of 224054021 is 120450422.
It is a happy number.
224054021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 222337921 + 1716100 = 14911^2 + 1310^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-224054021 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 224053984 and 224054002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (224054071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112027010 + 112027011.
It is an arithmetic number, because the mean of its divisors is an integer number (112027011).
Almost surely, 2224054021 is an apocalyptic number.
It is an amenable number.
224054021 is a deficient number, since it is larger than the sum of its proper divisors (1).
224054021 is an equidigital number, since it uses as much as digits as its factorization.
224054021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 640, while the sum is 20.
The square root of 224054021 is about 14968.4341532440. The cubic root of 224054021 is about 607.3666117524.
The spelling of 224054021 in words is "two hundred twenty-four million, fifty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •