Base | Representation |
---|---|
bin | 111100010000101… |
… | …101011111100000 |
3 | 2121110101210221011 |
4 | 330100231133200 |
5 | 4032304413400 |
6 | 244153310304 |
7 | 34024321342 |
oct | 7420553740 |
9 | 2543353834 |
10 | 1011013600 |
11 | 479766533 |
12 | 242705394 |
13 | 1315c51cc |
14 | 983b7292 |
15 | 5db598ba |
hex | 3c42d7e0 |
1011013600 has 36 divisors (see below), whose sum is σ = 2468138904. Its totient is φ = 404405120.
The previous prime is 1011013543. The next prime is 1011013603. The reversal of 1011013600 is 63101101.
It is a happy number.
1011013600 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011013603) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 631084 + ... + 632683.
It is an arithmetic number, because the mean of its divisors is an integer number (68559414).
Almost surely, 21011013600 is an apocalyptic number.
1011013600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1011013600 is an abundant number, since it is smaller than the sum of its proper divisors (1457125304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011013600 is a wasteful number, since it uses less digits than its factorization.
1011013600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1263787 (or 1263774 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1011013600 is about 31796.4400523077. The cubic root of 1011013600 is about 1003.6578041555.
Adding to 1011013600 its reverse (63101101), we get a palindrome (1074114701).
The spelling of 1011013600 in words is "one billion, eleven million, thirteen thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •