Base | Representation |
---|---|
bin | 1010000011011001111111… |
… | …1000110001101101101010 |
3 | 1110010201100201012022021012 |
4 | 2200312133320301231222 |
5 | 2422100320112014032 |
6 | 35301545151343522 |
7 | 2220412223630243 |
oct | 240663770615552 |
9 | 43121321168235 |
10 | 11053633313642 |
11 | 3581901924307 |
12 | 12a6327521ba2 |
13 | 622478b391ba |
14 | 2a2dda647cca |
15 | 1427e4ee16b2 |
hex | a0d9fe31b6a |
11053633313642 has 8 divisors (see below), whose sum is σ = 16580479843236. Its totient is φ = 5526806699232.
The previous prime is 11053633313617. The next prime is 11053633313647. The reversal of 11053633313642 is 24631333635011.
It can be written as a sum of positive squares in 2 ways, for example, as 11003344802641 + 50288511001 = 3317129^2 + 224251^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×110536333136422 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11053633313642.
It is not an unprimeable number, because it can be changed into a prime (11053633313647) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3503813 + ... + 5863784.
Almost surely, 211053633313642 is an apocalyptic number.
11053633313642 is a deficient number, since it is larger than the sum of its proper divisors (5526846529594).
11053633313642 is an equidigital number, since it uses as much as digits as its factorization.
11053633313642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9957592.
The product of its (nonzero) digits is 349920, while the sum is 41.
Adding to 11053633313642 its reverse (24631333635011), we get a palindrome (35684966948653).
The spelling of 11053633313642 in words is "eleven trillion, fifty-three billion, six hundred thirty-three million, three hundred thirteen thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •