Base | Representation |
---|---|
bin | 1010100000111100111101… |
… | …0100110000110101000101 |
3 | 1111221020120100220221221200 |
4 | 2220033033110300311011 |
5 | 3003404402220221013 |
6 | 40331054100133113 |
7 | 2302162121533062 |
oct | 250171724606505 |
9 | 44836510827850 |
10 | 11561235320133 |
11 | 3758101a347a4 |
12 | 136878a397199 |
13 | 65b2b1c0bb65 |
14 | 2bd7d1333c69 |
15 | 150b03205e73 |
hex | a83cf530d45 |
11561235320133 has 24 divisors (see below), whose sum is σ = 17239227572736. Its totient is φ = 7458441832800.
The previous prime is 11561235320087. The next prime is 11561235320143. The reversal of 11561235320133 is 33102353216511.
11561235320133 is a `hidden beast` number, since 1 + 1 + 5 + 612 + 3 + 5 + 3 + 2 + 0 + 1 + 33 = 666.
It is not a de Polignac number, because 11561235320133 - 28 = 11561235319877 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11561235320143) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3840391 + ... + 6153947.
It is an arithmetic number, because the mean of its divisors is an integer number (718301148864).
Almost surely, 211561235320133 is an apocalyptic number.
It is an amenable number.
11561235320133 is a deficient number, since it is larger than the sum of its proper divisors (5677992252603).
11561235320133 is a wasteful number, since it uses less digits than its factorization.
11561235320133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2331505 (or 2331502 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 36.
Adding to 11561235320133 its reverse (33102353216511), we get a palindrome (44663588536644).
The spelling of 11561235320133 in words is "eleven trillion, five hundred sixty-one billion, two hundred thirty-five million, three hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •