Base | Representation |
---|---|
bin | 10000001001000001100… |
… | …010000100000100110111 |
3 | 10221001001010101112222220 |
4 | 100021001202010010313 |
5 | 121133120424322444 |
6 | 2205320535053423 |
7 | 143065015013334 |
oct | 20110142040467 |
9 | 3831033345886 |
10 | 1109201010999 |
11 | 398456065814 |
12 | 15ab79211273 |
13 | 8079c0a7a93 |
14 | 3b98548598b |
15 | 1dcbd636619 |
hex | 10241884137 |
1109201010999 has 16 divisors (see below), whose sum is σ = 1543302720000. Its totient is φ = 707286093536.
The previous prime is 1109201010959. The next prime is 1109201011013. The reversal of 1109201010999 is 9990101029011.
It is a cyclic number.
It is not a de Polignac number, because 1109201010999 - 27 = 1109201010871 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1109201010999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1109201010949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1323502 + ... + 1992500.
It is an arithmetic number, because the mean of its divisors is an integer number (96456420000).
Almost surely, 21109201010999 is an apocalyptic number.
1109201010999 is a deficient number, since it is larger than the sum of its proper divisors (434101709001).
1109201010999 is a wasteful number, since it uses less digits than its factorization.
1109201010999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693054.
The product of its (nonzero) digits is 13122, while the sum is 42.
The spelling of 1109201010999 in words is "one trillion, one hundred nine billion, two hundred one million, ten thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •