Base | Representation |
---|---|
bin | 10000011111101100111… |
… | …011100000001101000111 |
3 | 11000100220010222111210111 |
4 | 100133230323200031013 |
5 | 122033003130421411 |
6 | 2224425112533451 |
7 | 144616314044146 |
oct | 20375473401507 |
9 | 4010803874714 |
10 | 1133551420231 |
11 | 3a781125266a |
12 | 1638340b1287 |
13 | 82b7cb71659 |
14 | 3cc1545775d |
15 | 1e746292721 |
hex | 107ecee0347 |
1133551420231 has 16 divisors (see below), whose sum is σ = 1171179839808. Its totient is φ = 1096680211200.
The previous prime is 1133551420223. The next prime is 1133551420237. The reversal of 1133551420231 is 1320241553311.
It is a cyclic number.
It is not a de Polignac number, because 1133551420231 - 23 = 1133551420223 is a prime.
It is a super-2 number, since 2×11335514202312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1133551420193 and 1133551420202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133551420237) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 465961 + ... + 1576141.
It is an arithmetic number, because the mean of its divisors is an integer number (73198739988).
Almost surely, 21133551420231 is an apocalyptic number.
1133551420231 is a deficient number, since it is larger than the sum of its proper divisors (37628419577).
1133551420231 is a wasteful number, since it uses less digits than its factorization.
1133551420231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1110522.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 1133551420231 its reverse (1320241553311), we get a palindrome (2453792973542).
The spelling of 1133551420231 in words is "one trillion, one hundred thirty-three billion, five hundred fifty-one million, four hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •