Base | Representation |
---|---|
bin | 11000101100011… |
… | …100010011000111 |
3 | 1001212120210110112 |
4 | 120230130103013 |
5 | 1322030202211 |
6 | 105035543235 |
7 | 13160343503 |
oct | 3054342307 |
9 | 1055523415 |
10 | 414303431 |
11 | 1a2955333 |
12 | b68bab1b |
13 | 67aabb79 |
14 | 3d049303 |
15 | 2658b88b |
hex | 18b1c4c7 |
414303431 has 4 divisors (see below), whose sum is σ = 414786600. Its totient is φ = 413820264.
The previous prime is 414303403. The next prime is 414303443. The reversal of 414303431 is 134303414.
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 414303431 - 210 = 414302407 is a prime.
It is a super-2 number, since 2×4143034312 = 343294665876743522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 414303397 and 414303406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (414303031) 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, 240296 + ... + 242013.
It is an arithmetic number, because the mean of its divisors is an integer number (103696650).
Almost surely, 2414303431 is an apocalyptic number.
414303431 is a deficient number, since it is larger than the sum of its proper divisors (483169).
414303431 is an equidigital number, since it uses as much as digits as its factorization.
414303431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 483168.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 414303431 is about 20354.4449936617. Note that the first 3 decimals coincide. The cubic root of 414303431 is about 745.4860309115.
Adding to 414303431 its reverse (134303414), we get a palindrome (548606845).
The spelling of 414303431 in words is "four hundred fourteen million, three hundred three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •