Base | Representation |
---|---|
bin | 10000101111000011110… |
… | …100001110010011110100 |
3 | 11001221110101000010120112 |
4 | 100233003310032103310 |
5 | 122320241111442002 |
6 | 2240153300522152 |
7 | 146042046406010 |
oct | 20570364162364 |
9 | 4057411003515 |
10 | 1150041515252 |
11 | 4038034aa073 |
12 | 166a766b0358 |
13 | 845aa322426 |
14 | 3d93b523540 |
15 | 1edadce6852 |
hex | 10bc3d0e4f4 |
1150041515252 has 12 divisors (see below), whose sum is σ = 2300083030560. Its totient is φ = 492874935096.
The previous prime is 1150041515237. The next prime is 1150041515261. The reversal of 1150041515252 is 2525151400511.
1150041515252 is an admirable number.
It is a super-2 number, since 2×11500415152522 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20536455602 + ... + 20536455657.
It is an arithmetic number, because the mean of its divisors is an integer number (191673585880).
Almost surely, 21150041515252 is an apocalyptic number.
It is an amenable number.
1150041515252 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.
1150041515252 is a wasteful number, since it uses less digits than its factorization.
1150041515252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41072911270 (or 41072911268 counting only the distinct ones).
The product of its (nonzero) digits is 10000, while the sum is 32.
Adding to 1150041515252 its reverse (2525151400511), we get a palindrome (3675192915763).
The spelling of 1150041515252 in words is "one trillion, one hundred fifty billion, forty-one million, five hundred fifteen thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •