Base | Representation |
---|---|
bin | 11010010011010001… |
… | …01111110010000011 |
3 | 1100110001212120202200 |
4 | 31021220233302003 |
5 | 212404300221011 |
6 | 10253051244243 |
7 | 1006625512041 |
oct | 151150576203 |
9 | 40401776680 |
10 | 14120320131 |
11 | 5a96609565 |
12 | 28a0a49683 |
13 | 1440518718 |
14 | 97d477391 |
15 | 57999d856 |
hex | 349a2fc83 |
14120320131 has 6 divisors (see below), whose sum is σ = 20396017980. Its totient is φ = 9413546748.
The previous prime is 14120320111. The next prime is 14120320157. The reversal of 14120320131 is 13102302141.
14120320131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14120320131 - 25 = 14120320099 is a prime.
It is a super-2 number, since 2×141203201312 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14120320111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 784462221 + ... + 784462238.
It is an arithmetic number, because the mean of its divisors is an integer number (3399336330).
Almost surely, 214120320131 is an apocalyptic number.
14120320131 is a deficient number, since it is larger than the sum of its proper divisors (6275697849).
14120320131 is a wasteful number, since it uses less digits than its factorization.
14120320131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1568924465 (or 1568924462 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 14120320131 its reverse (13102302141), we get a palindrome (27222622272).
The spelling of 14120320131 in words is "fourteen billion, one hundred twenty million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •