Base | Representation |
---|---|
bin | 11111111010110110111… |
… | …01000111111110001001 |
3 | 10212211220110112120201210 |
4 | 33331123131013332021 |
5 | 120432121230200321 |
6 | 2155501312403333 |
7 | 142144340604240 |
oct | 17753335077611 |
9 | 3784813476653 |
10 | 1096751021961 |
11 | 3931473a5781 |
12 | 158683846549 |
13 | 7c56694b56a |
14 | 3b123bad957 |
15 | 1d7e062ab76 |
hex | ff5b747f89 |
1096751021961 has 8 divisors (see below), whose sum is σ = 1671239652544. Its totient is φ = 626714869680.
The previous prime is 1096751021893. The next prime is 1096751022023. The reversal of 1096751021961 is 1691201576901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1096751021961 - 218 = 1096750759817 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1096751021961.
It is not an unprimeable number, because it can be changed into a prime (1096751071961) 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, 26113119550 + ... + 26113119591.
It is an arithmetic number, because the mean of its divisors is an integer number (208904956568).
Almost surely, 21096751021961 is an apocalyptic number.
It is an amenable number.
1096751021961 is a deficient number, since it is larger than the sum of its proper divisors (574488630583).
1096751021961 is an equidigital number, since it uses as much as digits as its factorization.
1096751021961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52226239151.
The product of its (nonzero) digits is 204120, while the sum is 48.
The spelling of 1096751021961 in words is "one trillion, ninety-six billion, seven hundred fifty-one million, twenty-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •