Base | Representation |
---|---|
bin | 11000111001111100110011… |
… | …110001010011101111001001 |
3 | 112100211111001201101210120001 |
4 | 120321330303301103233021 |
5 | 103324112014343420201 |
6 | 1024543513235403001 |
7 | 32033446543530631 |
oct | 3071746361235711 |
9 | 470744051353501 |
10 | 109535419513801 |
11 | 319a078a807756 |
12 | 10350846453461 |
13 | 49171b825b998 |
14 | 1d09784c2b6c1 |
15 | c9e4033ca301 |
hex | 639f33c53bc9 |
109535419513801 has 4 divisors (see below), whose sum is σ = 109885372931092. Its totient is φ = 109185466096512.
The previous prime is 109535419513763. The next prime is 109535419513831. The reversal of 109535419513801 is 108315914535901.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7483480004025 + 102051939509776 = 2735595^2 + 10102076^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-109535419513801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109535419513831) 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, 174976708176 + ... + 174976708801.
It is an arithmetic number, because the mean of its divisors is an integer number (27471343232773).
Almost surely, 2109535419513801 is an apocalyptic number.
It is an amenable number.
109535419513801 is a deficient number, since it is larger than the sum of its proper divisors (349953417291).
109535419513801 is an equidigital number, since it uses as much as digits as its factorization.
109535419513801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349953417290.
The product of its (nonzero) digits is 2916000, while the sum is 55.
The spelling of 109535419513801 in words is "one hundred nine trillion, five hundred thirty-five billion, four hundred nineteen million, five hundred thirteen thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •