Base | Representation |
---|---|
bin | 1011101011100001001… |
… | …11110000110000001111 |
3 | 1102100212210001222012211 |
4 | 11311300213300300033 |
5 | 23033401241230111 |
6 | 504210423011251 |
7 | 40665055604464 |
oct | 5656047606017 |
9 | 1370783058184 |
10 | 401321430031 |
11 | 145221537335 |
12 | 65941899b27 |
13 | 2bac933a5c2 |
14 | 155d18a166b |
15 | a68c91d521 |
hex | 5d709f0c0f |
401321430031 has 4 divisors (see below), whose sum is σ = 424928572992. Its totient is φ = 377714287072.
The previous prime is 401321429983. The next prime is 401321430047. The reversal of 401321430031 is 130034123104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 401321430031 - 221 = 401319332879 is a prime.
It is a super-2 number, since 2×4013214300312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 401321429984 and 401321430011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401321430131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11803571455 + ... + 11803571488.
It is an arithmetic number, because the mean of its divisors is an integer number (106232143248).
Almost surely, 2401321430031 is an apocalyptic number.
401321430031 is a deficient number, since it is larger than the sum of its proper divisors (23607142961).
401321430031 is a wasteful number, since it uses less digits than its factorization.
401321430031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23607142960.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 401321430031 its reverse (130034123104), we get a palindrome (531355553135).
The spelling of 401321430031 in words is "four hundred one billion, three hundred twenty-one million, four hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •