Base | Representation |
---|---|
bin | 1011101011011111111… |
… | …00101101001000101101 |
3 | 1102100211222211112100102 |
4 | 11311233330231020231 |
5 | 23033340344034041 |
6 | 504205341040445 |
7 | 40664560634654 |
oct | 5655774551055 |
9 | 1370758745312 |
10 | 401310143021 |
11 | 145216128227 |
12 | 65939b56125 |
13 | 2bac6bb7cb8 |
14 | 155d01a419b |
15 | a68b93e09b |
hex | 5d6ff2d22d |
401310143021 has 2 divisors, whose sum is σ = 401310143022. Its totient is φ = 401310143020.
The previous prime is 401310142967. The next prime is 401310143107. The reversal of 401310143021 is 120341013104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 382653588100 + 18656554921 = 618590^2 + 136589^2 .
It is a cyclic number.
It is not a de Polignac number, because 401310143021 - 230 = 400236401197 is a prime.
It is a super-2 number, since 2×4013101430212 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 401310142984 and 401310143002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (401310143621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200655071510 + 200655071511.
It is an arithmetic number, because the mean of its divisors is an integer number (200655071511).
Almost surely, 2401310143021 is an apocalyptic number.
It is an amenable number.
401310143021 is a deficient number, since it is larger than the sum of its proper divisors (1).
401310143021 is an equidigital number, since it uses as much as digits as its factorization.
401310143021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 401310143021 its reverse (120341013104), we get a palindrome (521651156125).
The spelling of 401310143021 in words is "four hundred one billion, three hundred ten million, one hundred forty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •