Base | Representation |
---|---|
bin | 1010000011011101001111… |
… | …0110100100011001100100 |
3 | 1110010210121110201011222121 |
4 | 2200313103312210121210 |
5 | 2422104111304300202 |
6 | 35302211454035324 |
7 | 2220442641256330 |
oct | 240672366443144 |
9 | 43123543634877 |
10 | 11054505150052 |
11 | 3582209a6a971 |
12 | 12a652b4a8b44 |
13 | 622587651730 |
14 | 2a30803527c0 |
15 | 142846808537 |
hex | a0dd3da4664 |
11054505150052 has 48 divisors (see below), whose sum is σ = 24020408829312. Its totient is φ = 4334509831680.
The previous prime is 11054505150041. The next prime is 11054505150053. The reversal of 11054505150052 is 25005150545011.
It is a super-2 number, since 2×110545051500522 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11054505150053) 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, 134337274 + ... + 134419537.
It is an arithmetic number, because the mean of its divisors is an integer number (500425183944).
Almost surely, 211054505150052 is an apocalyptic number.
It is an amenable number.
11054505150052 is an abundant number, since it is smaller than the sum of its proper divisors (12965903679260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11054505150052 is a wasteful number, since it uses less digits than its factorization.
11054505150052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268756948 (or 268756946 counting only the distinct ones).
The product of its (nonzero) digits is 25000, while the sum is 34.
Adding to 11054505150052 its reverse (25005150545011), we get a palindrome (36059655695063).
The spelling of 11054505150052 in words is "eleven trillion, fifty-four billion, five hundred five million, one hundred fifty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •