Base | Representation |
---|---|
bin | 1010000001000000110110… |
… | …0000101110000101110111 |
3 | 1102222210020122120021001110 |
4 | 2200100031200232011313 |
5 | 2420412121321000101 |
6 | 35231025543130103 |
7 | 2214425403362355 |
oct | 240201540560567 |
9 | 42883218507043 |
10 | 11012522828151 |
11 | 356642604a069 |
12 | 129a373743933 |
13 | 61b6269a4440 |
14 | 2a101a7ac7d5 |
15 | 1416daca1cd6 |
hex | a040d82e177 |
11012522828151 has 8 divisors (see below), whose sum is σ = 15812853291760. Its totient is φ = 6776937124992.
The previous prime is 11012522828129. The next prime is 11012522828171. The reversal of 11012522828151 is 15182822521011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11012522828151 - 27 = 11012522828023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 282372380209 = 11012522828151 / (1 + 1 + 0 + 1 + 2 + 5 + 2 + 2 + 8 + 2 + 8 + 1 + 5 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012522828171) 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, 141186190066 + ... + 141186190143.
It is an arithmetic number, because the mean of its divisors is an integer number (1976606661470).
Almost surely, 211012522828151 is an apocalyptic number.
11012522828151 is a deficient number, since it is larger than the sum of its proper divisors (4800330463609).
11012522828151 is a wasteful number, since it uses less digits than its factorization.
11012522828151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 282372380225.
The product of its (nonzero) digits is 25600, while the sum is 39.
The spelling of 11012522828151 in words is "eleven trillion, twelve billion, five hundred twenty-two million, eight hundred twenty-eight thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •