Base | Representation |
---|---|
bin | 11010001010111100… |
… | …00110010100111111 |
3 | 1100021012100021212002 |
4 | 31011132012110333 |
5 | 212233401420111 |
6 | 10242113132515 |
7 | 1005116412464 |
oct | 150536062477 |
9 | 40235307762 |
10 | 14050420031 |
11 | 5a6010658a |
12 | 288155a13b |
13 | 142bbb350b |
14 | 97407d66b |
15 | 57379263b |
hex | 34578653f |
14050420031 has 4 divisors (see below), whose sum is σ = 14082869472. Its totient is φ = 14017970592.
The previous prime is 14050420003. The next prime is 14050420037. The reversal of 14050420031 is 13002405041.
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 14050420031 - 222 = 14046225727 is a prime.
It is a super-2 number, since 2×140504200312 (a number of 21 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 = 14050419985 and 14050420012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14050420037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16224071 + ... + 16224936.
It is an arithmetic number, because the mean of its divisors is an integer number (3520717368).
Almost surely, 214050420031 is an apocalyptic number.
14050420031 is a deficient number, since it is larger than the sum of its proper divisors (32449441).
14050420031 is an equidigital number, since it uses as much as digits as its factorization.
14050420031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32449440.
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 14050420031 its reverse (13002405041), we get a palindrome (27052825072).
The spelling of 14050420031 in words is "fourteen billion, fifty million, four hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •