Base | Representation |
---|---|
bin | 11000110100001110011101… |
… | …010001001110011110000001 |
3 | 112022102212201021221220100001 |
4 | 120310032131101032132001 |
5 | 103301140410414403111 |
6 | 1024043100003200001 |
7 | 31663152543210106 |
oct | 3064163521163601 |
9 | 468385637856301 |
10 | 109142052497281 |
11 | 31859980341a91 |
12 | 102a8564676001 |
13 | 48b9088b92c4b |
14 | 1cd4709968aad |
15 | c9407dea01c1 |
hex | 63439d44e781 |
109142052497281 has 4 divisors (see below), whose sum is σ = 109142087742000. Its totient is φ = 109142017252564.
The previous prime is 109142052497279. The next prime is 109142052497293. The reversal of 109142052497281 is 182794250241901.
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.
It is a cyclic number.
It is not a de Polignac number, because 109142052497281 - 21 = 109142052497279 is a prime.
It is a super-2 number, since 2×1091420524972812 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109142052497081) 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, 12476431 + ... + 19337668.
It is an arithmetic number, because the mean of its divisors is an integer number (27285521935500).
Almost surely, 2109142052497281 is an apocalyptic number.
It is an amenable number.
109142052497281 is a deficient number, since it is larger than the sum of its proper divisors (35244719).
109142052497281 is an equidigital number, since it uses as much as digits as its factorization.
109142052497281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35244718.
The product of its (nonzero) digits is 2903040, while the sum is 55.
The spelling of 109142052497281 in words is "one hundred nine trillion, one hundred forty-two billion, fifty-two million, four hundred ninety-seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •