Base | Representation |
---|---|
bin | 100001001101011… |
… | …0000101011111111 |
3 | 2212122202212220110 |
4 | 1002122300223333 |
5 | 4240230431143 |
6 | 302323321103 |
7 | 36420330231 |
oct | 10232605377 |
9 | 2778685813 |
10 | 1114311423 |
11 | 521aaa735 |
12 | 271220193 |
13 | 149b21a94 |
14 | a7dc6251 |
15 | 67c61533 |
hex | 426b0aff |
1114311423 has 8 divisors (see below), whose sum is σ = 1486030000. Its totient is φ = 742733568.
The previous prime is 1114311403. The next prime is 1114311433. The reversal of 1114311423 is 3241134111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1114311423 - 210 = 1114310399 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 1114311423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114311403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15058 + ... + 49551.
It is an arithmetic number, because the mean of its divisors is an integer number (185753750).
Almost surely, 21114311423 is an apocalyptic number.
1114311423 is a deficient number, since it is larger than the sum of its proper divisors (371718577).
1114311423 is an equidigital number, since it uses as much as digits as its factorization.
1114311423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70361.
The product of its digits is 288, while the sum is 21.
The square root of 1114311423 is about 33381.3034946211. The cubic root of 1114311423 is about 1036.7376267612.
Adding to 1114311423 its reverse (3241134111), we get a palindrome (4355445534).
The spelling of 1114311423 in words is "one billion, one hundred fourteen million, three hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •