Base | Representation |
---|---|
bin | 10111111010101… |
… | …101100101010111 |
3 | 1000222001110212220 |
4 | 113322231211113 |
5 | 1310211021111 |
6 | 103452313423 |
7 | 12641466504 |
oct | 2772554527 |
9 | 1028043786 |
10 | 401267031 |
11 | 196560950 |
12 | b2472873 |
13 | 65196219 |
14 | 3b4144ab |
15 | 25363e06 |
hex | 17ead957 |
401267031 has 32 divisors (see below), whose sum is σ = 620524800. Its totient is φ = 227950080.
The previous prime is 401267029. The next prime is 401267033. The reversal of 401267031 is 130762104.
It is an interprime number because it is at equal distance from previous prime (401267029) and next prime (401267033).
It is not a de Polignac number, because 401267031 - 21 = 401267029 is a prime.
It is a super-2 number, since 2×4012670312 = 322030460335109922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 401266992 and 401267010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401267033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 149580 + ... + 152238.
It is an arithmetic number, because the mean of its divisors is an integer number (19391400).
Almost surely, 2401267031 is an apocalyptic number.
401267031 is a deficient number, since it is larger than the sum of its proper divisors (219257769).
401267031 is a wasteful number, since it uses less digits than its factorization.
401267031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2959.
The product of its (nonzero) digits is 1008, while the sum is 24.
The square root of 401267031 is about 20031.6507307810. The cubic root of 401267031 is about 737.5834434361.
The spelling of 401267031 in words is "four hundred one million, two hundred sixty-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •