Base | Representation |
---|---|
bin | 110011001011010011… |
… | …1011011001111100001 |
3 | 101111200012022100002011 |
4 | 1212112213123033201 |
5 | 3300034140200001 |
6 | 122253213552521 |
7 | 10640310636160 |
oct | 1462647331741 |
9 | 344605270064 |
10 | 109901100001 |
11 | 42677340080 |
12 | 193717a5741 |
13 | a495b7ccb4 |
14 | 5467ddb3d7 |
15 | 2cd35add51 |
hex | 19969db3e1 |
109901100001 has 8 divisors (see below), whose sum is σ = 137019553344. Its totient is φ = 85637220720.
The previous prime is 109901099909. The next prime is 109901100041. The reversal of 109901100001 is 100001109901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 109901100001 - 221 = 109899002849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109901100041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 713643430 + ... + 713643583.
It is an arithmetic number, because the mean of its divisors is an integer number (17127444168).
Almost surely, 2109901100001 is an apocalyptic number.
109901100001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
109901100001 is a deficient number, since it is larger than the sum of its proper divisors (27118453343).
109901100001 is a wasteful number, since it uses less digits than its factorization.
109901100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1427287031.
The product of its (nonzero) digits is 81, while the sum is 22.
Adding to 109901100001 its reverse (100001109901), we get a palindrome (209902209902).
It can be divided in two parts, 109901 and 100001, that multiplied together give a palindrome (10990209901).
The spelling of 109901100001 in words is "one hundred nine billion, nine hundred one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •