Base | Representation |
---|---|
bin | 110010111110100110… |
… | …1110011000001101001 |
3 | 101110120111102201220221 |
4 | 1211331031303001221 |
5 | 3243201041420043 |
6 | 122143032050041 |
7 | 10623614506102 |
oct | 1457515630151 |
9 | 343514381827 |
10 | 109474951273 |
11 | 42478835246 |
12 | 19272b33921 |
13 | a4287b469c |
14 | 542758b3a9 |
15 | 2caae828ed |
hex | 197d373069 |
109474951273 has 2 divisors, whose sum is σ = 109474951274. Its totient is φ = 109474951272.
The previous prime is 109474951237. The next prime is 109474951303. The reversal of 109474951273 is 372159474901.
Together with previous prime (109474951237) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91462090329 + 18012860944 = 302427^2 + 134212^2 .
It is an emirp because it is prime and its reverse (372159474901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109474951273 - 233 = 100885016681 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 109474951273.
It is not a weakly prime, because it can be changed into another prime (109474951073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54737475636 + 54737475637.
It is an arithmetic number, because the mean of its divisors is an integer number (54737475637).
Almost surely, 2109474951273 is an apocalyptic number.
It is an amenable number.
109474951273 is a deficient number, since it is larger than the sum of its proper divisors (1).
109474951273 is an equidigital number, since it uses as much as digits as its factorization.
109474951273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1905120, while the sum is 52.
The spelling of 109474951273 in words is "one hundred nine billion, four hundred seventy-four million, nine hundred fifty-one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •