Base | Representation |
---|---|
bin | 1011101011001011110… |
… | …01100000001100001101 |
3 | 1102100102020120011200202 |
4 | 11311211321200030031 |
5 | 23033014213001110 |
6 | 504140515103245 |
7 | 40660442520626 |
oct | 5654571401415 |
9 | 1370366504622 |
10 | 401141531405 |
11 | 145139a3388a |
12 | 658b15a1b25 |
13 | 2ba9aca0904 |
14 | 155b5a32a4d |
15 | a67bc350a5 |
hex | 5d65e6030d |
401141531405 has 8 divisors (see below), whose sum is σ = 481705763832. Its totient is φ = 320689274368.
The previous prime is 401141531377. The next prime is 401141531423. The reversal of 401141531405 is 504135141104.
It can be written as a sum of positive squares in 4 ways, for example, as 127567551556 + 273573979849 = 357166^2 + 523043^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 401141531405 - 210 = 401141530381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27985964 + ... + 28000293.
It is an arithmetic number, because the mean of its divisors is an integer number (60213220479).
Almost surely, 2401141531405 is an apocalyptic number.
It is an amenable number.
401141531405 is a deficient number, since it is larger than the sum of its proper divisors (80564232427).
401141531405 is a wasteful number, since it uses less digits than its factorization.
401141531405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55987695.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 401141531405 its reverse (504135141104), we get a palindrome (905276672509).
The spelling of 401141531405 in words is "four hundred one billion, one hundred forty-one million, five hundred thirty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •