Base | Representation |
---|---|
bin | 10000001001111101001… |
… | …000101110010010001001 |
3 | 10221010121211001022112012 |
4 | 100021331020232102021 |
5 | 121142142424013342 |
6 | 2210004100225305 |
7 | 143131546543346 |
oct | 20117510562211 |
9 | 3833554038465 |
10 | 1110201001097 |
11 | 398919582111 |
12 | 15b1b809b235 |
13 | 808cb3105b6 |
14 | 3ba3c1cd7cd |
15 | 1dd2b314b82 |
hex | 1027d22e489 |
1110201001097 has 8 divisors (see below), whose sum is σ = 1181414016000. Its totient is φ = 1039644327744.
The previous prime is 1110201001079. The next prime is 1110201001111. The reversal of 1110201001097 is 7901001020111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110201001097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1110201001067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164081897 + ... + 164088662.
It is an arithmetic number, because the mean of its divisors is an integer number (147676752000).
Almost surely, 21110201001097 is an apocalyptic number.
1110201001097 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1110201001097 is a deficient number, since it is larger than the sum of its proper divisors (71213014903).
1110201001097 is a wasteful number, since it uses less digits than its factorization.
1110201001097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328170775.
The product of its (nonzero) digits is 126, while the sum is 23.
The spelling of 1110201001097 in words is "one trillion, one hundred ten billion, two hundred one million, one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •