Base | Representation |
---|---|
bin | 11101011100010001001… |
… | …00111001011010110000 |
3 | 10120201010202012220002201 |
4 | 32232020210321122300 |
5 | 113033233311011204 |
6 | 2052420540552544 |
7 | 133041414655234 |
oct | 16561044713260 |
9 | 3521122186081 |
10 | 1011608688304 |
11 | 360025806275 |
12 | 144081852754 |
13 | 74518341586 |
14 | 36d680c25c4 |
15 | 1b4aa98c9a4 |
hex | eb889396b0 |
1011608688304 has 80 divisors (see below), whose sum is σ = 2055404160000. Its totient is φ = 481404374528.
The previous prime is 1011608688271. The next prime is 1011608688319. The reversal of 1011608688304 is 4038868061101.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 131836212 + ... + 131843884.
It is an arithmetic number, because the mean of its divisors is an integer number (25692552000).
Almost surely, 21011608688304 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1011608688304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1027702080000).
1011608688304 is an abundant number, since it is smaller than the sum of its proper divisors (1043795471696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011608688304 is a wasteful number, since it uses less digits than its factorization.
1011608688304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9442 (or 9436 counting only the distinct ones).
The product of its (nonzero) digits is 221184, while the sum is 46.
The spelling of 1011608688304 in words is "one trillion, eleven billion, six hundred eight million, six hundred eighty-eight thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •