Base | Representation |
---|---|
bin | 10000011111010101000… |
… | …001000011100101110101 |
3 | 11000022212012001120021000 |
4 | 100133111001003211311 |
5 | 122031142424111314 |
6 | 2224321221513513 |
7 | 144603342654111 |
oct | 20372501034565 |
9 | 4008765046230 |
10 | 1133150222709 |
11 | 3a7625839a6a |
12 | 163741872899 |
13 | 82b17a00c7b |
14 | 3cbb8060741 |
15 | 1e720e44209 |
hex | 107d5043975 |
1133150222709 has 8 divisors (see below), whose sum is σ = 1678741070720. Its totient is φ = 755433481788.
The previous prime is 1133150222683. The next prime is 1133150222759. The reversal of 1133150222709 is 9072220513311.
It is a happy number.
1133150222709 is a `hidden beast` number, since 1 + 1 + 331 + 50 + 2 + 2 + 270 + 9 = 666.
It is not a de Polignac number, because 1133150222709 - 213 = 1133150214517 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 (1133150222759) 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 7 ways as a sum of consecutive naturals, for example, 20984263357 + ... + 20984263410.
It is an arithmetic number, because the mean of its divisors is an integer number (209842633840).
Almost surely, 21133150222709 is an apocalyptic number.
It is an amenable number.
1133150222709 is a deficient number, since it is larger than the sum of its proper divisors (545590848011).
1133150222709 is an equidigital number, since it uses as much as digits as its factorization.
1133150222709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41968526776 (or 41968526770 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The spelling of 1133150222709 in words is "one trillion, one hundred thirty-three billion, one hundred fifty million, two hundred twenty-two thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •