Base | Representation |
---|---|
bin | 1010000111100101000111… |
… | …1100110110000100010001 |
3 | 1110101120110002100121201201 |
4 | 2201321101330312010101 |
5 | 2424234144042414413 |
6 | 35354524415031201 |
7 | 2225531205256456 |
oct | 241712174660421 |
9 | 43346402317651 |
10 | 11125340201233 |
11 | 35aa259563285 |
12 | 12b81b9b0b501 |
13 | 629165aa20bb |
14 | 2a667dc1982d |
15 | 1445e03b69dd |
hex | a1e51f36111 |
11125340201233 has 8 divisors (see below), whose sum is σ = 11213469115200. Its totient is φ = 11037533514480.
The previous prime is 11125340201219. The next prime is 11125340201251. The reversal of 11125340201233 is 33210204352111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11125340201233 - 229 = 11124803330321 is a prime.
It is a super-2 number, since 2×111253402012332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11125340201273) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80487478 + ... + 80625583.
It is an arithmetic number, because the mean of its divisors is an integer number (1401683639400).
Almost surely, 211125340201233 is an apocalyptic number.
It is an amenable number.
11125340201233 is a deficient number, since it is larger than the sum of its proper divisors (88128913967).
11125340201233 is a wasteful number, since it uses less digits than its factorization.
11125340201233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161113607.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 11125340201233 its reverse (33210204352111), we get a palindrome (44335544553344).
The spelling of 11125340201233 in words is "eleven trillion, one hundred twenty-five billion, three hundred forty million, two hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •