Base | Representation |
---|---|
bin | 10000101111001010010… |
… | …110011100100111100100 |
3 | 11001221202000022011020200 |
4 | 100233022112130213210 |
5 | 122321002143300202 |
6 | 2240212214430500 |
7 | 146044550320002 |
oct | 20571226344744 |
9 | 4057660264220 |
10 | 1150151150052 |
11 | 40385a381343 |
12 | 166aa7362430 |
13 | 845c6c5a4a8 |
14 | 3d94bd01a72 |
15 | 1edb8750e1c |
hex | 10bca59c9e4 |
1150151150052 has 36 divisors (see below), whose sum is σ = 2974938766800. Its totient is φ = 374467815792.
The previous prime is 1150151150021. The next prime is 1150151150069. The reversal of 1150151150052 is 2500511510511.
It is a happy number.
1150151150052 is a `hidden beast` number, since 1 + 1 + 5 + 0 + 151 + 1 + 500 + 5 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 1150151149998 and 1150151150025.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 371494302 + ... + 371497397.
Almost surely, 21150151150052 is an apocalyptic number.
1150151150052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1150151150052 is an abundant number, since it is smaller than the sum of its proper divisors (1824787616748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1150151150052 is a wasteful number, since it uses less digits than its factorization.
1150151150052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 742991752 (or 742991747 counting only the distinct ones).
The product of its (nonzero) digits is 1250, while the sum is 27.
Adding to 1150151150052 its reverse (2500511510511), we get a palindrome (3650662660563).
The spelling of 1150151150052 in words is "one trillion, one hundred fifty billion, one hundred fifty-one million, one hundred fifty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •