Base | Representation |
---|---|
bin | 101010000100000… |
… | …1001010000100111 |
3 | 10122100211121221010 |
4 | 1110020021100213 |
5 | 10342310434343 |
6 | 352015353303 |
7 | 46655611452 |
oct | 12410112047 |
9 | 3570747833 |
10 | 1411421223 |
11 | 66478a723 |
12 | 334822833 |
13 | 19654a1b4 |
14 | d5646499 |
15 | 83d9dd33 |
hex | 54209427 |
1411421223 has 4 divisors (see below), whose sum is σ = 1881894968. Its totient is φ = 940947480.
The previous prime is 1411421191. The next prime is 1411421237. The reversal of 1411421223 is 3221241141.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1411421223 - 25 = 1411421191 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1411421223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1411426223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 235236868 + ... + 235236873.
It is an arithmetic number, because the mean of its divisors is an integer number (470473742).
Almost surely, 21411421223 is an apocalyptic number.
1411421223 is a deficient number, since it is larger than the sum of its proper divisors (470473745).
1411421223 is an equidigital number, since it uses as much as digits as its factorization.
1411421223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470473744.
The product of its digits is 384, while the sum is 21.
The square root of 1411421223 is about 37568.8863689090. The cubic root of 1411421223 is about 1121.7228011425.
Adding to 1411421223 its reverse (3221241141), we get a palindrome (4632662364).
The spelling of 1411421223 in words is "one billion, four hundred eleven million, four hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •