Base | Representation |
---|---|
bin | 10100011011101011101… |
… | …010110010111111000101 |
3 | 11222020021001201011102221 |
4 | 110123223222302333011 |
5 | 141001110440000031 |
6 | 2553012442532341 |
7 | 203305143205645 |
oct | 24335352627705 |
9 | 4866231634387 |
10 | 1404113203141 |
11 | 4a1532330730 |
12 | 1a81628070b1 |
13 | a253ab1289c |
14 | 4bd609ca525 |
15 | 267ce2e6a11 |
hex | 146ebab2fc5 |
1404113203141 has 8 divisors (see below), whose sum is σ = 1564350493824. Its totient is φ = 1249307685120.
The previous prime is 1404113203121. The next prime is 1404113203187. The reversal of 1404113203141 is 1413023114041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1404113203141 - 29 = 1404113202629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404113203121) 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, 1357942620 + ... + 1357943653.
It is an arithmetic number, because the mean of its divisors is an integer number (195543811728).
Almost surely, 21404113203141 is an apocalyptic number.
1404113203141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1404113203141 is a deficient number, since it is larger than the sum of its proper divisors (160237290683).
1404113203141 is a wasteful number, since it uses less digits than its factorization.
1404113203141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2715886331.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1404113203141 its reverse (1413023114041), we get a palindrome (2817136317182).
The spelling of 1404113203141 in words is "one trillion, four hundred four billion, one hundred thirteen million, two hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •