Base | Representation |
---|---|
bin | 10111111010000… |
… | …100000000011011 |
3 | 1000221201211021111 |
4 | 113322010000123 |
5 | 1310140043411 |
6 | 103444521151 |
7 | 12640160140 |
oct | 2772040033 |
9 | 1027654244 |
10 | 401096731 |
11 | 196454a02 |
12 | b23b01b7 |
13 | 65136859 |
14 | 3b3ac3c7 |
15 | 2532d721 |
hex | 17e8401b |
401096731 has 16 divisors (see below), whose sum is σ = 470200320. Its totient is φ = 335008800.
The previous prime is 401096719. The next prime is 401096743. The reversal of 401096731 is 137690104.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (401096719) and next prime (401096743).
It is not a de Polignac number, because 401096731 - 213 = 401088539 is a prime.
It is a super-2 number, since 2×4010967312 = 321757175237772722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 401096693 and 401096702.
It is not an unprimeable number, because it can be changed into a prime (401096711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76081 + ... + 81181.
It is an arithmetic number, because the mean of its divisors is an integer number (29387520).
Almost surely, 2401096731 is an apocalyptic number.
401096731 is a deficient number, since it is larger than the sum of its proper divisors (69103589).
401096731 is a wasteful number, since it uses less digits than its factorization.
401096731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5394.
The product of its (nonzero) digits is 4536, while the sum is 31.
The square root of 401096731 is about 20027.3995066758. The cubic root of 401096731 is about 737.4790838078.
The spelling of 401096731 in words is "four hundred one million, ninety-six thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •