Base | Representation |
---|---|
bin | 11010011111001101… |
… | …01001101011010011 |
3 | 1100201001020220100121 |
4 | 31033212221223103 |
5 | 213110412343011 |
6 | 10311025131111 |
7 | 1012252460431 |
oct | 151746515323 |
9 | 40631226317 |
10 | 14220434131 |
11 | 6038078702 |
12 | 290a489a97 |
13 | 145819c087 |
14 | 98c897d51 |
15 | 583676e71 |
hex | 34f9a9ad3 |
14220434131 has 4 divisors (see below), whose sum is σ = 14453556064. Its totient is φ = 13987312200.
The previous prime is 14220434117. The next prime is 14220434167. The reversal of 14220434131 is 13143402241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13143402241 = 103 ⋅127605847.
It is not a de Polignac number, because 14220434131 - 27 = 14220434003 is a prime.
It is a super-2 number, since 2×142204341312 (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 = 14220434096 and 14220434105.
It is not an unprimeable number, because it can be changed into a prime (14220434531) 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, 116560875 + ... + 116560996.
It is an arithmetic number, because the mean of its divisors is an integer number (3613389016).
Almost surely, 214220434131 is an apocalyptic number.
14220434131 is a deficient number, since it is larger than the sum of its proper divisors (233121933).
14220434131 is an equidigital number, since it uses as much as digits as its factorization.
14220434131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233121932.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 14220434131 its reverse (13143402241), we get a palindrome (27363836372).
The spelling of 14220434131 in words is "fourteen billion, two hundred twenty million, four hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •