Base | Representation |
---|---|
bin | 10100011011110110110… |
… | …111010101110110000111 |
3 | 11222020202011011022120211 |
4 | 110123312313111312013 |
5 | 141002002031303111 |
6 | 2553043232540251 |
7 | 203312613620200 |
oct | 24336667256607 |
9 | 4866664138524 |
10 | 1404301041031 |
11 | 4a1619367059 |
12 | 1a81b56b1687 |
13 | a256a9cc175 |
14 | 4bd7b9245a7 |
15 | 267e0a4c521 |
hex | 146f6dd5d87 |
1404301041031 has 12 divisors (see below), whose sum is σ = 1633677646608. Its totient is φ = 1203610736832.
The previous prime is 1404301041019. The next prime is 1404301041037. The reversal of 1404301041031 is 1301401034041.
It is a happy number.
It is not a de Polignac number, because 1404301041031 - 25 = 1404301040999 is a prime.
It is a super-2 number, since 2×14043010410312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1404301040993 and 1404301041011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404301041037) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 110866 + ... + 1679551.
It is an arithmetic number, because the mean of its divisors is an integer number (136139803884).
Almost surely, 21404301041031 is an apocalyptic number.
1404301041031 is a deficient number, since it is larger than the sum of its proper divisors (229376605577).
1404301041031 is a wasteful number, since it uses less digits than its factorization.
1404301041031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1806438 (or 1806431 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1404301041031 its reverse (1301401034041), we get a palindrome (2705702075072).
The spelling of 1404301041031 in words is "one trillion, four hundred four billion, three hundred one million, forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •