Base | Representation |
---|---|
bin | 10111111010111… |
… | …111110011111011 |
3 | 1000222012021022002 |
4 | 113322333303323 |
5 | 1310220413231 |
6 | 103454051215 |
7 | 12642230252 |
oct | 2772776373 |
9 | 1028167262 |
10 | 401341691 |
11 | 196601a53 |
12 | b24a9b0b |
13 | 651c11ba |
14 | 3b433799 |
15 | 2537b0cb |
hex | 17ebfcfb |
401341691 has 4 divisors (see below), whose sum is σ = 401383584. Its totient is φ = 401299800.
The previous prime is 401341679. The next prime is 401341727. The reversal of 401341691 is 196143104.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 401341691 - 226 = 334232827 is a prime.
It is a super-2 number, since 2×4013416912 = 322150305869478962, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401341621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1301 + ... + 28361.
It is an arithmetic number, because the mean of its divisors is an integer number (100345896).
Almost surely, 2401341691 is an apocalyptic number.
401341691 is a deficient number, since it is larger than the sum of its proper divisors (41893).
401341691 is a wasteful number, since it uses less digits than its factorization.
401341691 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41892.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 401341691 is about 20033.5141949684. The cubic root of 401341691 is about 737.6291856814.
Adding to 401341691 its reverse (196143104), we get a palindrome (597484795).
The spelling of 401341691 in words is "four hundred one million, three hundred forty-one thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •