Base | Representation |
---|---|
bin | 10100011011100101101… |
… | …101101111110101111011 |
3 | 11222020000002202020111000 |
4 | 110123211231233311323 |
5 | 141000404402012103 |
6 | 2552554513540043 |
7 | 203302521153141 |
oct | 24334555576573 |
9 | 4866002666430 |
10 | 1404013313403 |
11 | 4a1490a05028 |
12 | 1a8135274623 |
13 | a252320a32c |
14 | 4bd51627591 |
15 | 267c5664aa3 |
hex | 146e5b6fd7b |
1404013313403 has 8 divisors (see below), whose sum is σ = 2080019723600. Its totient is φ = 936008875584.
The previous prime is 1404013313401. The next prime is 1404013313407. The reversal of 1404013313403 is 3043133104041.
It is not a de Polignac number, because 1404013313403 - 21 = 1404013313401 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 52000493089 = 1404013313403 / (1 + 4 + 0 + 4 + 0 + 1 + 3 + 3 + 1 + 3 + 4 + 0 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1404013313401) 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, 26000246518 + ... + 26000246571.
It is an arithmetic number, because the mean of its divisors is an integer number (260002465450).
Almost surely, 21404013313403 is an apocalyptic number.
1404013313403 is a deficient number, since it is larger than the sum of its proper divisors (676006410197).
1404013313403 is an equidigital number, since it uses as much as digits as its factorization.
1404013313403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52000493098 (or 52000493092 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 1404013313403 its reverse (3043133104041), we get a palindrome (4447146417444).
The spelling of 1404013313403 in words is "one trillion, four hundred four billion, thirteen million, three hundred thirteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •