Base | Representation |
---|---|
bin | 1011101011100011101… |
… | …11110101110110000101 |
3 | 1102100221020120111100011 |
4 | 11311301313311312011 |
5 | 23033422130004110 |
6 | 504212452550221 |
7 | 40665432205651 |
oct | 5656167656605 |
9 | 1370836514304 |
10 | 401342422405 |
11 | 145232375201 |
12 | 65948922371 |
13 | 2bb007aa622 |
14 | 155d45a7a61 |
15 | a68e6b848a |
hex | 5d71df5d85 |
401342422405 has 8 divisors (see below), whose sum is σ = 497146742784. Its totient is φ = 310716714000.
The previous prime is 401342422381. The next prime is 401342422409. The reversal of 401342422405 is 504224243104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-401342422405 is a prime.
It is a super-2 number, since 2×4013424224052 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401342422409) 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, 1294652821 + ... + 1294653130.
It is an arithmetic number, because the mean of its divisors is an integer number (62143342848).
Almost surely, 2401342422405 is an apocalyptic number.
It is an amenable number.
401342422405 is a deficient number, since it is larger than the sum of its proper divisors (95804320379).
401342422405 is a wasteful number, since it uses less digits than its factorization.
401342422405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2589305987.
The product of its (nonzero) digits is 30720, while the sum is 31.
Adding to 401342422405 its reverse (504224243104), we get a palindrome (905566665509).
The spelling of 401342422405 in words is "four hundred one billion, three hundred forty-two million, four hundred twenty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •