Base | Representation |
---|---|
bin | 1110111101000010… |
… | …0111011011011111 |
3 | 101100202020221022201 |
4 | 3233100213123133 |
5 | 31210103013211 |
6 | 1502152152331 |
7 | 201321242602 |
oct | 35720473337 |
9 | 11322227281 |
10 | 4014110431 |
11 | 177a951641 |
12 | 9403986a7 |
13 | 4bc822196 |
14 | 2a1188339 |
15 | 1876110c1 |
hex | ef4276df |
4014110431 has 4 divisors (see below), whose sum is σ = 4250234592. Its totient is φ = 3777986272.
The previous prime is 4014110417. The next prime is 4014110437. The reversal of 4014110431 is 1340114104.
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 4014110431 - 211 = 4014108383 is a prime.
It is a super-2 number, since 2×40141104312 = 32226165104526011522, 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 = 4014110399 and 4014110408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4014110437) 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, 118062055 + ... + 118062088.
It is an arithmetic number, because the mean of its divisors is an integer number (1062558648).
Almost surely, 24014110431 is an apocalyptic number.
4014110431 is a deficient number, since it is larger than the sum of its proper divisors (236124161).
4014110431 is a wasteful number, since it uses less digits than its factorization.
4014110431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236124160.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 4014110431 is about 63357.0077497352. The cubic root of 4014110431 is about 1589.2654374945.
Adding to 4014110431 its reverse (1340114104), we get a palindrome (5354224535).
The spelling of 4014110431 in words is "four billion, fourteen million, one hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •