Base | Representation |
---|---|
bin | 11010111011011001… |
… | …10111100111011101 |
3 | 1101022112021220102202 |
4 | 31131230313213131 |
5 | 214101434220432 |
6 | 10350314301245 |
7 | 1021154002016 |
oct | 153554674735 |
9 | 41275256382 |
10 | 14456945117 |
11 | 614962892a |
12 | 2975727825 |
13 | 149519aac4 |
14 | 9b206200d |
15 | 5992e4462 |
hex | 35db379dd |
14456945117 has 4 divisors (see below), whose sum is σ = 14458654236. Its totient is φ = 14455236000.
The previous prime is 14456945059. The next prime is 14456945123. The reversal of 14456945117 is 71154965441.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 71154965441 = 7 ⋅10164995063.
It can be written as a sum of positive squares in 2 ways, for example, as 3787294681 + 10669650436 = 61541^2 + 103294^2 .
It is a cyclic number.
It is not a de Polignac number, because 14456945117 - 210 = 14456944093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14456945137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 841808 + ... + 858809.
It is an arithmetic number, because the mean of its divisors is an integer number (3614663559).
Almost surely, 214456945117 is an apocalyptic number.
It is an amenable number.
14456945117 is a deficient number, since it is larger than the sum of its proper divisors (1709119).
14456945117 is an equidigital number, since it uses as much as digits as its factorization.
14456945117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1709118.
The product of its digits is 604800, while the sum is 47.
The spelling of 14456945117 in words is "fourteen billion, four hundred fifty-six million, nine hundred forty-five thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •