Base | Representation |
---|---|
bin | 101001110110101… |
… | …0111001100100111 |
3 | 10121212121221012111 |
4 | 1103231113030213 |
5 | 10334011303143 |
6 | 351205101451 |
7 | 46542130606 |
oct | 12355271447 |
9 | 3555557174 |
10 | 1404400423 |
11 | 660824908 |
12 | 3323b7887 |
13 | 194c5c68a |
14 | d4739a3d |
15 | 8346399d |
hex | 53b57327 |
1404400423 has 4 divisors (see below), whose sum is σ = 1428203880. Its totient is φ = 1380596968.
The previous prime is 1404400397. The next prime is 1404400463. The reversal of 1404400423 is 3240044041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3240044041 = 13 ⋅249234157.
It is a cyclic number.
It is not a de Polignac number, because 1404400423 - 29 = 1404399911 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1404400394 and 1404400403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404400463) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11901640 + ... + 11901757.
It is an arithmetic number, because the mean of its divisors is an integer number (357050970).
Almost surely, 21404400423 is an apocalyptic number.
1404400423 is a deficient number, since it is larger than the sum of its proper divisors (23803457).
1404400423 is an equidigital number, since it uses as much as digits as its factorization.
1404400423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23803456.
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 1404400423 is about 37475.3308591132. The cubic root of 1404400423 is about 1119.8597887298.
Adding to 1404400423 its reverse (3240044041), we get a palindrome (4644444464).
The spelling of 1404400423 in words is "one billion, four hundred four million, four hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •