Base | Representation |
---|---|
bin | 11011000100100111… |
… | …01111101011111001 |
3 | 1101111220202011002120 |
4 | 31202103233223321 |
5 | 214231231320423 |
6 | 10402115151453 |
7 | 1023113021313 |
oct | 154223575371 |
9 | 41456664076 |
10 | 14534245113 |
11 | 6189225523 |
12 | 29975a5589 |
13 | 14a81c424b |
14 | 9bc4247b3 |
15 | 5a0eb2ee3 |
hex | 3624efaf9 |
14534245113 has 4 divisors (see below), whose sum is σ = 19378993488. Its totient is φ = 9689496740.
The previous prime is 14534245097. The next prime is 14534245153. The reversal of 14534245113 is 31154243541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31154243541 = 3 ⋅10384747847.
It is a cyclic number.
It is not a de Polignac number, because 14534245113 - 24 = 14534245097 is a prime.
It is a super-2 number, since 2×145342451132 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14534245153) 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, 2422374183 + ... + 2422374188.
It is an arithmetic number, because the mean of its divisors is an integer number (4844748372).
Almost surely, 214534245113 is an apocalyptic number.
It is an amenable number.
14534245113 is a deficient number, since it is larger than the sum of its proper divisors (4844748375).
14534245113 is an equidigital number, since it uses as much as digits as its factorization.
14534245113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4844748374.
The product of its digits is 28800, while the sum is 33.
Adding to 14534245113 its reverse (31154243541), we get a palindrome (45688488654).
The spelling of 14534245113 in words is "fourteen billion, five hundred thirty-four million, two hundred forty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •