Base | Representation |
---|---|
bin | 11000110011100110111101… |
… | …010111111010000000000001 |
3 | 112022021211020121002021210211 |
4 | 120303212331113322000001 |
5 | 103244442031202241101 |
6 | 1024011403335154121 |
7 | 31660121551215334 |
oct | 3063467527720001 |
9 | 468254217067724 |
10 | 109099641446401 |
11 | 31842997413811 |
12 | 102a02a9215941 |
13 | 48b508a455a78 |
14 | 1cd26450a261b |
15 | c92dea9acc51 |
hex | 6339bd5fa001 |
109099641446401 has 4 divisors (see below), whose sum is σ = 109100888059312. Its totient is φ = 109098394833492.
The previous prime is 109099641446381. The next prime is 109099641446443. The reversal of 109099641446401 is 104644146990901.
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 109099641446401 - 221 = 109099639349249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109099641446491) 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, 623175171 + ... + 623350216.
It is an arithmetic number, because the mean of its divisors is an integer number (27275222014828).
Almost surely, 2109099641446401 is an apocalyptic number.
It is an amenable number.
109099641446401 is a deficient number, since it is larger than the sum of its proper divisors (1246612911).
109099641446401 is an equidigital number, since it uses as much as digits as its factorization.
109099641446401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1246612910.
The product of its (nonzero) digits is 6718464, while the sum is 58.
The spelling of 109099641446401 in words is "one hundred nine trillion, ninety-nine billion, six hundred forty-one million, four hundred forty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •