Base | Representation |
---|---|
bin | 101010000111100… |
… | …0110000011100111 |
3 | 10122111021012002110 |
4 | 1110033012003213 |
5 | 10343242234421 |
6 | 352122412103 |
7 | 50010240210 |
oct | 12417060347 |
9 | 3574235073 |
10 | 1413243111 |
11 | 665814515 |
12 | 335361033 |
13 | 196a37537 |
14 | d599c407 |
15 | 8410da76 |
hex | 543c60e7 |
1413243111 has 8 divisors (see below), whose sum is σ = 2153513344. Its totient is φ = 807567480.
The previous prime is 1413243101. The next prime is 1413243137. The reversal of 1413243111 is 1113423141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1413243111 - 29 = 1413242599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 67297291 = 1413243111 / (1 + 4 + 1 + 3 + 2 + 4 + 3 + 1 + 1 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1413243101) 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, 33648625 + ... + 33648666.
It is an arithmetic number, because the mean of its divisors is an integer number (269189168).
Almost surely, 21413243111 is an apocalyptic number.
1413243111 is a deficient number, since it is larger than the sum of its proper divisors (740270233).
1413243111 is an equidigital number, since it uses as much as digits as its factorization.
1413243111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67297301.
The product of its digits is 288, while the sum is 21.
The square root of 1413243111 is about 37593.1258476866. The cubic root of 1413243111 is about 1122.2052403037.
Adding to 1413243111 its reverse (1113423141), we get a palindrome (2526666252).
The spelling of 1413243111 in words is "one billion, four hundred thirteen million, two hundred forty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •