Base | Representation |
---|---|
bin | 100000101010101… |
… | …0101001000001001 |
3 | 2211101112012001221 |
4 | 1001111111020021 |
5 | 4221101014401 |
6 | 300433242041 |
7 | 36106533505 |
oct | 10125251011 |
9 | 2741465057 |
10 | 1096110601 |
11 | 5127a9133 |
12 | 267103321 |
13 | 14611b571 |
14 | a5809305 |
15 | 663687a1 |
hex | 41555209 |
1096110601 has 2 divisors, whose sum is σ = 1096110602. Its totient is φ = 1096110600.
The previous prime is 1096110583. The next prime is 1096110611. The reversal of 1096110601 is 1060116901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 802022400 + 294088201 = 28320^2 + 17149^2 .
It is an emirp because it is prime and its reverse (1060116901) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 1090119601 and 1069110901.
It is a cyclic number.
It is not a de Polignac number, because 1096110601 - 27 = 1096110473 is a prime.
It is not a weakly prime, because it can be changed into another prime (1096110611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 548055300 + 548055301.
It is an arithmetic number, because the mean of its divisors is an integer number (548055301).
Almost surely, 21096110601 is an apocalyptic number.
It is an amenable number.
1096110601 is a deficient number, since it is larger than the sum of its proper divisors (1).
1096110601 is an equidigital number, since it uses as much as digits as its factorization.
1096110601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 25.
The square root of 1096110601 is about 33107.5610850452. The cubic root of 1096110601 is about 1031.0620273932.
The spelling of 1096110601 in words is "one billion, ninety-six million, one hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •