Base | Representation |
---|---|
bin | 10000101111001001000… |
… | …110010111000000010110 |
3 | 11001221200112210112012020 |
4 | 100233021012113000112 |
5 | 122320431304434132 |
6 | 2240210144434010 |
7 | 146044204006344 |
oct | 20571106270026 |
9 | 4057615715166 |
10 | 1150130155542 |
11 | 403849541905 |
12 | 166aa0318906 |
13 | 845c27b94c4 |
14 | 3d9491d8994 |
15 | 1edb69a552c |
hex | 10bc9197016 |
1150130155542 has 8 divisors (see below), whose sum is σ = 2300260311096. Its totient is φ = 383376718512.
The previous prime is 1150130155519. The next prime is 1150130155549. The reversal of 1150130155542 is 2455510310511.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1150130155542 is an admirable number.
It is a super-2 number, since 2×11501301555422 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150130155549) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95844179623 + ... + 95844179634.
It is an arithmetic number, because the mean of its divisors is an integer number (287532538887).
Almost surely, 21150130155542 is an apocalyptic number.
1150130155542 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1150130155542 is a wasteful number, since it uses less digits than its factorization.
1150130155542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191688359262.
The product of its (nonzero) digits is 15000, while the sum is 33.
The spelling of 1150130155542 in words is "one trillion, one hundred fifty billion, one hundred thirty million, one hundred fifty-five thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •