Base | Representation |
---|---|
bin | 10100100101110110… |
… | …11111011100101011 |
3 | 1001112102221100202200 |
4 | 22102323133130223 |
5 | 140120040102220 |
6 | 5024551031243 |
7 | 540644656500 |
oct | 122273373453 |
9 | 31472840680 |
10 | 11055003435 |
11 | 4763296783 |
12 | 218636b523 |
13 | 1072445268 |
14 | 76c30b4a7 |
15 | 44a806890 |
hex | 292edf72b |
11055003435 has 72 divisors (see below), whose sum is σ = 23059267920. Its totient is φ = 4879421568.
The previous prime is 11055003373. The next prime is 11055003437. The reversal of 11055003435 is 53430055011.
11055003435 is a `hidden beast` number, since 110 + 5 + 500 + 3 + 43 + 5 = 666.
It is not a de Polignac number, because 11055003435 - 214 = 11054987051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11055003399 and 11055003408.
It is not an unprimeable number, because it can be changed into a prime (11055003437) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 22497 + ... + 150386.
It is an arithmetic number, because the mean of its divisors is an integer number (320267610).
Almost surely, 211055003435 is an apocalyptic number.
11055003435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11055003435 is an abundant number, since it is smaller than the sum of its proper divisors (12004264485).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11055003435 is a wasteful number, since it uses less digits than its factorization.
11055003435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172937 (or 172927 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
Adding to 11055003435 its reverse (53430055011), we get a palindrome (64485058446).
The spelling of 11055003435 in words is "eleven billion, fifty-five million, three thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •