Base | Representation |
---|---|
bin | 101010111010110… |
… | …0101011101010111 |
3 | 10201100211012010002 |
4 | 1111311211131113 |
5 | 10422132013143 |
6 | 354522321515 |
7 | 50454510443 |
oct | 12565453527 |
9 | 3640735102 |
10 | 1440110423 |
11 | 6799a5304 |
12 | 34235929b |
13 | 19c48365b |
14 | d9393823 |
15 | 866695b8 |
hex | 55d65757 |
1440110423 has 4 divisors (see below), whose sum is σ = 1440329640. Its totient is φ = 1439891208.
The previous prime is 1440110417. The next prime is 1440110467. The reversal of 1440110423 is 3240110441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1440110423 - 26 = 1440110359 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1440110395 and 1440110404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1440112423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99440 + ... + 112997.
It is an arithmetic number, because the mean of its divisors is an integer number (360082410).
Almost surely, 21440110423 is an apocalyptic number.
1440110423 is a deficient number, since it is larger than the sum of its proper divisors (219217).
1440110423 is an equidigital number, since it uses as much as digits as its factorization.
1440110423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219216.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 1440110423 is about 37948.7868449045. The cubic root of 1440110423 is about 1129.2720983699.
Adding to 1440110423 its reverse (3240110441), we get a palindrome (4680220864).
The spelling of 1440110423 in words is "one billion, four hundred forty million, one hundred ten thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •