Base | Representation |
---|---|
bin | 1011101011000110111… |
… | …10111000110101011111 |
3 | 1102100022102021222002202 |
4 | 11311203132320311133 |
5 | 23032423324000111 |
6 | 504132510242115 |
7 | 40656441150434 |
oct | 5654336706537 |
9 | 1370272258082 |
10 | 401101000031 |
11 | 14511906aa86 |
12 | 6589bab633b |
13 | 2ba9277c254 |
14 | 155b04c1b8b |
15 | a6783cab3b |
hex | 5d637b8d5f |
401101000031 has 8 divisors (see below), whose sum is σ = 427995300720. Its totient is φ = 374785071552.
The previous prime is 401101000021. The next prime is 401101000049. The reversal of 401101000031 is 130000101104.
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 401101000031 - 218 = 401100737887 is a prime.
It is a super-2 number, since 2×4011010000312 (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 = 401100999976 and 401101000021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401101000021) 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, 144591620 + ... + 144594393.
It is an arithmetic number, because the mean of its divisors is an integer number (53499412590).
Almost surely, 2401101000031 is an apocalyptic number.
401101000031 is a deficient number, since it is larger than the sum of its proper divisors (26894300689).
401101000031 is a wasteful number, since it uses less digits than its factorization.
401101000031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289186105.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 401101000031 its reverse (130000101104), we get a palindrome (531101101135).
The spelling of 401101000031 in words is "four hundred one billion, one hundred one million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •