Base | Representation |
---|---|
bin | 10000100001110011000… |
… | …001011110111001010101 |
3 | 11000120200221012211211202 |
4 | 100201303001132321111 |
5 | 122102110042302202 |
6 | 2225440240042245 |
7 | 145026132231326 |
oct | 20416301367125 |
9 | 4016627184752 |
10 | 1135801134677 |
11 | 3a8766148400 |
12 | 164161603385 |
13 | 8314ac8b431 |
14 | 3cd8a15644d |
15 | 1e828a2e802 |
hex | 1087305ee55 |
1135801134677 has 6 divisors (see below), whose sum is σ = 1248442569654. Its totient is φ = 1032546485960.
The previous prime is 1135801134623. The next prime is 1135801134697. The reversal of 1135801134677 is 7764311085311.
It can be written as a sum of positive squares in only one way, i.e., 624670510321 + 511130624356 = 790361^2 + 714934^2 .
It is not a de Polignac number, because 1135801134677 - 240 = 36289506901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1135801134607) 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 5 ways as a sum of consecutive naturals, for example, 4693392998 + ... + 4693393239.
It is an arithmetic number, because the mean of its divisors is an integer number (208073761609).
Almost surely, 21135801134677 is an apocalyptic number.
It is an amenable number.
1135801134677 is a deficient number, since it is larger than the sum of its proper divisors (112641434977).
1135801134677 is an equidigital number, since it uses as much as digits as its factorization.
1135801134677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9386786259 (or 9386786248 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 47.
The spelling of 1135801134677 in words is "one trillion, one hundred thirty-five billion, eight hundred one million, one hundred thirty-four thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •