Base | Representation |
---|---|
bin | 101101100101111010001010… |
… | …0111001101110000010110111 |
3 | 1221120221111201010102002001101 |
4 | 1123023310110321232002313 |
5 | 410031021302443121120 |
6 | 3540532343451310531 |
7 | 150320526412621135 |
oct | 13313642471560267 |
9 | 1846844633362041 |
10 | 401034332004535 |
11 | 106866783522759 |
12 | 38b8b18244b447 |
13 | 142a04b5525378 |
14 | 7106245594755 |
15 | 3156c5397590a |
hex | 16cbd14e6e0b7 |
401034332004535 has 32 divisors (see below), whose sum is σ = 522445194657792. Its totient is φ = 294640721907840.
The previous prime is 401034332004419. The next prime is 401034332004539. The reversal of 401034332004535 is 535400233430104.
It is a happy number.
It is not a de Polignac number, because 401034332004535 - 27 = 401034332004407 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 401034332004494 and 401034332004503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401034332004539) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 442429524 + ... + 443335033.
It is an arithmetic number, because the mean of its divisors is an integer number (16326412333056).
Almost surely, 2401034332004535 is an apocalyptic number.
401034332004535 is a deficient number, since it is larger than the sum of its proper divisors (121410862653257).
401034332004535 is a wasteful number, since it uses less digits than its factorization.
401034332004535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 885764743.
The product of its (nonzero) digits is 259200, while the sum is 37.
Adding to 401034332004535 its reverse (535400233430104), we get a palindrome (936434565434639).
The spelling of 401034332004535 in words is "four hundred one trillion, thirty-four billion, three hundred thirty-two million, four thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •