Base | Representation |
---|---|
bin | 1100000011111000011… |
… | …10111100100110010111 |
3 | 1110121122022212202121211 |
4 | 12001330032330212113 |
5 | 23242143143402211 |
6 | 514212342522251 |
7 | 41640150454036 |
oct | 6017416744627 |
9 | 1417568782554 |
10 | 414401153431 |
11 | 14a8237140a1 |
12 | 68392136387 |
13 | 301020a37c5 |
14 | 160b2a6071d |
15 | aba5d6be21 |
hex | 607c3bc997 |
414401153431 has 4 divisors (see below), whose sum is σ = 414404380000. Its totient is φ = 414397926864.
The previous prime is 414401153393. The next prime is 414401153449. The reversal of 414401153431 is 134351104414.
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 414401153431 - 27 = 414401153303 is a prime.
It is a super-2 number, since 2×4144011534312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 414401153393 and 414401153402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (414401153471) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1412286 + ... + 1680283.
It is an arithmetic number, because the mean of its divisors is an integer number (103601095000).
Almost surely, 2414401153431 is an apocalyptic number.
414401153431 is a deficient number, since it is larger than the sum of its proper divisors (3226569).
414401153431 is a wasteful number, since it uses less digits than its factorization.
414401153431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3226568.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 414401153431 its reverse (134351104414), we get a palindrome (548752257845).
The spelling of 414401153431 in words is "four hundred fourteen billion, four hundred one million, one hundred fifty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •