Base | Representation |
---|---|
bin | 10111111011000… |
… | …101100011101111 |
3 | 1000222020110120221 |
4 | 113323011203233 |
5 | 1310222141411 |
6 | 103454352211 |
7 | 12642356011 |
oct | 2773054357 |
9 | 1028213527 |
10 | 401365231 |
11 | 196618703 |
12 | b24bb667 |
13 | 651cbb27 |
14 | 3b43c1b1 |
15 | 25383071 |
hex | 17ec58ef |
401365231 has 4 divisors (see below), whose sum is σ = 402483600. Its totient is φ = 400246864.
The previous prime is 401365199. The next prime is 401365241. The reversal of 401365231 is 132563104.
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 401365231 - 25 = 401365199 is a prime.
It is a super-2 number, since 2×4013652312 = 322188097311366722, 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 = 401365196 and 401365205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401365241) 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 3 ways as a sum of consecutive naturals, for example, 558646 + ... + 559363.
It is an arithmetic number, because the mean of its divisors is an integer number (100620900).
Almost surely, 2401365231 is an apocalyptic number.
401365231 is a deficient number, since it is larger than the sum of its proper divisors (1118369).
401365231 is a wasteful number, since it uses less digits than its factorization.
401365231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1118368.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 401365231 is about 20034.1017018483. The cubic root of 401365231 is about 737.6436068525.
The spelling of 401365231 in words is "four hundred one million, three hundred sixty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •