Base | Representation |
---|---|
bin | 10111111011000… |
… | …010111010100101 |
3 | 1000222012220201222 |
4 | 113323002322211 |
5 | 1310221320110 |
6 | 103454230125 |
7 | 12642312314 |
oct | 2773027245 |
9 | 1028186658 |
10 | 401354405 |
11 | 196610561 |
12 | b24b5345 |
13 | 651c6c1a |
14 | 3b43827b |
15 | 2537ec55 |
hex | 17ec2ea5 |
401354405 has 8 divisors (see below), whose sum is σ = 482176032. Its totient is φ = 320716368.
The previous prime is 401354399. The next prime is 401354419. The reversal of 401354405 is 504453104.
401354405 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 401354405 - 216 = 401288869 is a prime.
It is a super-2 number, since 2×4013544052 = 322170716825808050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 41039 + ... + 49868.
It is an arithmetic number, because the mean of its divisors is an integer number (60272004).
Almost surely, 2401354405 is an apocalyptic number.
It is an amenable number.
401354405 is a deficient number, since it is larger than the sum of its proper divisors (80821627).
401354405 is an equidigital number, since it uses as much as digits as its factorization.
401354405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91795.
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 401354405 is about 20033.8315107221. The cubic root of 401354405 is about 737.6369746541.
The spelling of 401354405 in words is "four hundred one million, three hundred fifty-four thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •