Base | Representation |
---|---|
bin | 1011110100001111011… |
… | …00000100011010111111 |
3 | 1102210222002000210221000 |
4 | 11322013230010122333 |
5 | 23122443332334211 |
6 | 510303153541343 |
7 | 41222066660004 |
oct | 5720754043277 |
9 | 1383862023830 |
10 | 406003402431 |
11 | 147204377510 |
12 | 66829874853 |
13 | 2c394328983 |
14 | 159176198ab |
15 | a8639a4656 |
hex | 5e87b046bf |
406003402431 has 16 divisors (see below), whose sum is σ = 656167115520. Its totient is φ = 246062667960.
The previous prime is 406003402421. The next prime is 406003402591. The reversal of 406003402431 is 134204300604.
406003402431 is a `hidden beast` number, since 4 + 0 + 600 + 3 + 4 + 0 + 24 + 31 = 666.
It is not a de Polignac number, because 406003402431 - 213 = 406003394239 is a prime.
It is a super-2 number, since 2×4060034024312 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 406003402395 and 406003402404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (406003402421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 683507115 + ... + 683507708.
It is an arithmetic number, because the mean of its divisors is an integer number (41010444720).
Almost surely, 2406003402431 is an apocalyptic number.
406003402431 is a deficient number, since it is larger than the sum of its proper divisors (250163713089).
406003402431 is a wasteful number, since it uses less digits than its factorization.
406003402431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1367014843 (or 1367014837 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
The spelling of 406003402431 in words is "four hundred six billion, three million, four hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •