Base | Representation |
---|---|
bin | 10000101111010101000… |
… | …110011100000000111010 |
3 | 11001222012120200000111112 |
4 | 100233111012130000322 |
5 | 122321334331041100 |
6 | 2240242140200322 |
7 | 146052200304221 |
oct | 20572506340072 |
9 | 4058176600445 |
10 | 1150331502650 |
11 | 403942164980 |
12 | 166b378390a2 |
13 | 846254259c5 |
14 | 3d967c4bcb8 |
15 | 1edc94c8b35 |
hex | 10bd519c03a |
1150331502650 has 48 divisors (see below), whose sum is σ = 2367002305728. Its totient is φ = 412410768000.
The previous prime is 1150331502647. The next prime is 1150331502709. The reversal of 1150331502650 is 562051330511.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14689907 + ... + 14768006.
It is an arithmetic number, because the mean of its divisors is an integer number (49312548036).
Almost surely, 21150331502650 is an apocalyptic number.
1150331502650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1150331502650 is an abundant number, since it is smaller than the sum of its proper divisors (1216670803078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1150331502650 is a wasteful number, since it uses less digits than its factorization.
1150331502650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29458007 (or 29458002 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 32.
The spelling of 1150331502650 in words is "one trillion, one hundred fifty billion, three hundred thirty-one million, five hundred two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •