Base | Representation |
---|---|
bin | 10000001111011000100… |
… | …101110111110111111110 |
3 | 10221200200001222020101210 |
4 | 100033120211313313332 |
5 | 121241112231232020 |
6 | 2212410335145250 |
7 | 143426162224335 |
oct | 20173045676776 |
9 | 3850601866353 |
10 | 1116030336510 |
11 | 3a0340037091 |
12 | 160364375226 |
13 | 81319c236ab |
14 | 3c032494d1c |
15 | 1e06ce8a3e0 |
hex | 103d8977dfe |
1116030336510 has 64 divisors (see below), whose sum is σ = 2745312030720. Its totient is φ = 290189502720.
The previous prime is 1116030336481. The next prime is 1116030336521. The reversal of 1116030336510 is 156330306111.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1993431 + ... + 2491149.
It is an arithmetic number, because the mean of its divisors is an integer number (42895500480).
Almost surely, 21116030336510 is an apocalyptic number.
1116030336510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1116030336510, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1372656015360).
1116030336510 is an abundant number, since it is smaller than the sum of its proper divisors (1629281694210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116030336510 is a wasteful number, since it uses less digits than its factorization.
1116030336510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499593.
The product of its (nonzero) digits is 4860, while the sum is 30.
The spelling of 1116030336510 in words is "one trillion, one hundred sixteen billion, thirty million, three hundred thirty-six thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •