Base | Representation |
---|---|
bin | 1101000111100110101111… |
… | …1101010000011111010100 |
3 | 1220001221200001200102111112 |
4 | 3101321223331100133110 |
5 | 3342311442204303104 |
6 | 50402234232554152 |
7 | 3016056611633003 |
oct | 321715375203724 |
9 | 56057601612445 |
10 | 14424311400404 |
11 | 4661352820a34 |
12 | 174b640852958 |
13 | 80828c24b4c9 |
14 | 37c1d736ac3a |
15 | 1a0321ce986e |
hex | d1e6bf507d4 |
14424311400404 has 12 divisors (see below), whose sum is σ = 25273747113300. Its totient is φ = 7203240796608.
The previous prime is 14424311400403. The next prime is 14424311400407. The reversal of 14424311400404 is 40400411342441.
It can be written as a sum of positive squares in 2 ways, for example, as 10160169000004 + 4264142400400 = 3187502^2 + 2064980^2 .
It is a super-2 number, since 2×144243114004042 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14424311400403) 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, 2228722259 + ... + 2228728730.
It is an arithmetic number, because the mean of its divisors is an integer number (2106145592775).
Almost surely, 214424311400404 is an apocalyptic number.
It is an amenable number.
14424311400404 is a deficient number, since it is larger than the sum of its proper divisors (10849435712896).
14424311400404 is a wasteful number, since it uses less digits than its factorization.
14424311400404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4457451802 (or 4457451800 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 14424311400404 its reverse (40400411342441), we get a palindrome (54824722742845).
The spelling of 14424311400404 in words is "fourteen trillion, four hundred twenty-four billion, three hundred eleven million, four hundred thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •