Base | Representation |
---|---|
bin | 10111111011011… |
… | …000011101001001 |
3 | 1000222101101202200 |
4 | 113323120131021 |
5 | 1310232131013 |
6 | 103500150413 |
7 | 12643130454 |
oct | 2773303511 |
9 | 1028341680 |
10 | 401442633 |
11 | 196670879 |
12 | b2538409 |
13 | 65228127 |
14 | 3b45c49b |
15 | 2539ae73 |
hex | 17ed8749 |
401442633 has 12 divisors (see below), whose sum is σ = 580040448. Its totient is φ = 267545880.
The previous prime is 401442631. The next prime is 401442661. The reversal of 401442633 is 336244104.
It is not a de Polignac number, because 401442633 - 21 = 401442631 is a prime.
It is a super-2 number, since 2×4014426332 = 322312375179945378, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 401442597 and 401442606.
It is not an unprimeable number, because it can be changed into a prime (401442631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 42816 + ... + 51342.
It is an arithmetic number, because the mean of its divisors is an integer number (48336704).
Almost surely, 2401442633 is an apocalyptic number.
It is an amenable number.
401442633 is a deficient number, since it is larger than the sum of its proper divisors (178597815).
401442633 is a wasteful number, since it uses less digits than its factorization.
401442633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13764 (or 13761 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
The square root of 401442633 is about 20036.0333649153. The cubic root of 401442633 is about 737.6910212075.
Adding to 401442633 its reverse (336244104), we get a palindrome (737686737).
The spelling of 401442633 in words is "four hundred one million, four hundred forty-two thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •