Base | Representation |
---|---|
bin | 10110010010110000… |
… | …10000101110111000 |
3 | 1010220002212120001100 |
4 | 23021120100232320 |
5 | 144002414440000 |
6 | 5255342451400 |
7 | 602406461511 |
oct | 131130205670 |
9 | 33802776040 |
10 | 11968515000 |
11 | 5091a07512 |
12 | 23a0293b60 |
13 | 118978c950 |
14 | 817783a08 |
15 | 4a0b01a00 |
hex | 2c9610bb8 |
11968515000 has 480 divisors, whose sum is σ = 44774730000. Its totient is φ = 2868480000.
The previous prime is 11968514963. The next prime is 11968515011. The reversal of 11968515000 is 51586911.
11968515000 is a `hidden beast` number, since 11 + 96 + 8 + 51 + 500 + 0 = 666.
It is a super-4 number, since 4×119685150004 (a number of 41 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 23984751 + ... + 23985249.
Almost surely, 211968515000 is an apocalyptic number.
11968515000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11968515000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22387365000).
11968515000 is an abundant number, since it is smaller than the sum of its proper divisors (32806215000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11968515000 is a wasteful number, since it uses less digits than its factorization.
11968515000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585 (or 563 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 36.
The spelling of 11968515000 in words is "eleven billion, nine hundred sixty-eight million, five hundred fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •