Base | Representation |
---|---|
bin | 10000110100101100101… |
… | …011111010010001010001 |
3 | 11002112002022102022011211 |
4 | 100310230223322101101 |
5 | 122420141023122433 |
6 | 2243034135340121 |
7 | 146345064050362 |
oct | 20645453722121 |
9 | 4075068368154 |
10 | 1156095910993 |
11 | 406330003211 |
12 | 168086221641 |
13 | 8503375530a |
14 | 3dd53651b69 |
15 | 201155c68cd |
hex | 10d2cafa451 |
1156095910993 has 4 divisors (see below), whose sum is σ = 1157599287460. Its totient is φ = 1154592534528.
The previous prime is 1156095910919. The next prime is 1156095910999. The reversal of 1156095910993 is 3990195906511.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 321838366864 + 834257544129 = 567308^2 + 913377^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1156095910993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1156095910999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 751687080 + ... + 751688617.
It is an arithmetic number, because the mean of its divisors is an integer number (289399821865).
Almost surely, 21156095910993 is an apocalyptic number.
It is an amenable number.
1156095910993 is a deficient number, since it is larger than the sum of its proper divisors (1503376467).
1156095910993 is an equidigital number, since it uses as much as digits as its factorization.
1156095910993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1503376466.
The product of its (nonzero) digits is 2952450, while the sum is 58.
The spelling of 1156095910993 in words is "one trillion, one hundred fifty-six billion, ninety-five million, nine hundred ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •