Base | Representation |
---|---|
bin | 1011101011101010101… |
… | …00101011010000111111 |
3 | 1102101002021111122011101 |
4 | 11311311110223100333 |
5 | 23034031440003040 |
6 | 504222321433531 |
7 | 41000034235621 |
oct | 5656524532077 |
9 | 1371067448141 |
10 | 401400312895 |
11 | 14526201518a |
12 | 6596419b8a7 |
13 | 2bb0c79935a |
14 | 155dc156c11 |
15 | a69480109a |
hex | 5d7552b43f |
401400312895 has 8 divisors (see below), whose sum is σ = 485473135104. Its totient is φ = 318591743904.
The previous prime is 401400312893. The next prime is 401400312917. The reversal of 401400312895 is 598213004104.
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 401400312895 - 21 = 401400312893 is a prime.
It is a super-2 number, since 2×4014003128952 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401400312893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 316062604 + ... + 316063873.
It is an arithmetic number, because the mean of its divisors is an integer number (60684141888).
Almost surely, 2401400312895 is an apocalyptic number.
401400312895 is a deficient number, since it is larger than the sum of its proper divisors (84072822209).
401400312895 is a wasteful number, since it uses less digits than its factorization.
401400312895 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632126609.
The product of its (nonzero) digits is 34560, while the sum is 37.
Adding to 401400312895 its reverse (598213004104), we get a palindrome (999613316999).
The spelling of 401400312895 in words is "four hundred one billion, four hundred million, three hundred twelve thousand, eight hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •