Base | Representation |
---|---|
bin | 10111111001101… |
… | …111101001110001 |
3 | 1000221120120220201 |
4 | 113321233221301 |
5 | 1310124411421 |
6 | 103443035201 |
7 | 12636362110 |
oct | 2771575161 |
9 | 1027516821 |
10 | 401013361 |
11 | 1963a8301 |
12 | b236bb01 |
13 | 65107918 |
14 | 3b389c77 |
15 | 25313b91 |
hex | 17e6fa71 |
401013361 has 4 divisors (see below), whose sum is σ = 458300992. Its totient is φ = 343725732.
The previous prime is 401013343. The next prime is 401013377. The reversal of 401013361 is 163310104.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 401013361 - 29 = 401012849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401013341) 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, 28643805 + ... + 28643818.
It is an arithmetic number, because the mean of its divisors is an integer number (114575248).
Almost surely, 2401013361 is an apocalyptic number.
It is an amenable number.
401013361 is a deficient number, since it is larger than the sum of its proper divisors (57287631).
401013361 is an equidigital number, since it uses as much as digits as its factorization.
401013361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57287630.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 401013361 is about 20025.3179999719. The cubic root of 401013361 is about 737.4279840050.
Adding to 401013361 its reverse (163310104), we get a palindrome (564323465).
It can be divided in two parts, 4010 and 13361, that added together give a palindrome (17371).
The spelling of 401013361 in words is "four hundred one million, thirteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •