Base | Representation |
---|---|
bin | 11010010101100000… |
… | …11011110001010011 |
3 | 1100111101020100002111 |
4 | 31022300123301103 |
5 | 212424103100111 |
6 | 10255002130151 |
7 | 1010244321265 |
oct | 151260336123 |
9 | 40441210074 |
10 | 14139112531 |
11 | 5aa6184575 |
12 | 28a71b0957 |
13 | 144439829b |
14 | 981b69b35 |
15 | 57b461a21 |
hex | 34ac1bc53 |
14139112531 has 2 divisors, whose sum is σ = 14139112532. Its totient is φ = 14139112530.
The previous prime is 14139112451. The next prime is 14139112541. The reversal of 14139112531 is 13521193141.
14139112531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (13521193141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14139112531 - 29 = 14139112019 is a prime.
It is a super-2 number, since 2×141391125312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14139112493 and 14139112502.
It is not a weakly prime, because it can be changed into another prime (14139112541) 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 as a sum of consecutive naturals, namely, 7069556265 + 7069556266.
It is an arithmetic number, because the mean of its divisors is an integer number (7069556266).
Almost surely, 214139112531 is an apocalyptic number.
14139112531 is a deficient number, since it is larger than the sum of its proper divisors (1).
14139112531 is an equidigital number, since it uses as much as digits as its factorization.
14139112531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3240, while the sum is 31.
The spelling of 14139112531 in words is "fourteen billion, one hundred thirty-nine million, one hundred twelve thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •