Base | Representation |
---|---|
bin | 1010000001001010101001… |
… | …0001010001010101111110 |
3 | 1110000001000221022201202211 |
4 | 2200102222101101111332 |
5 | 2420433013104114100 |
6 | 35232142532411034 |
7 | 2214550516650211 |
oct | 240225221212576 |
9 | 43001027281684 |
10 | 11015152801150 |
11 | 3567555656773 |
12 | 129a988476a7a |
13 | 61b95580cc94 |
14 | 2a11c9bb3778 |
15 | 1417e1b031ba |
hex | a04aa45157e |
11015152801150 has 12 divisors (see below), whose sum is σ = 20488184210232. Its totient is φ = 4406061120440.
The previous prime is 11015152801139. The next prime is 11015152801193. The reversal of 11015152801150 is 5110825151011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 110151527962 + ... + 110151528061.
It is an arithmetic number, because the mean of its divisors is an integer number (1707348684186).
Almost surely, 211015152801150 is an apocalyptic number.
11015152801150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11015152801150 is a deficient number, since it is larger than the sum of its proper divisors (9473031409082).
11015152801150 is a wasteful number, since it uses less digits than its factorization.
11015152801150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220303056035 (or 220303056030 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 31.
Adding to 11015152801150 its reverse (5110825151011), we get a palindrome (16125977952161).
The spelling of 11015152801150 in words is "eleven trillion, fifteen billion, one hundred fifty-two million, eight hundred one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •