Base | Representation |
---|---|
bin | 10101000100010001… |
… | …00110111000100000 |
3 | 1002012012221121110121 |
4 | 22202020212320200 |
5 | 141130341200000 |
6 | 5110142410024 |
7 | 550163156323 |
oct | 124210467040 |
9 | 32165847417 |
10 | 11310100000 |
11 | 4884290591 |
12 | 2237890914 |
13 | 10b3250684 |
14 | 7941527ba |
15 | 462de5b1a |
hex | 2a2226e20 |
11310100000 has 144 divisors (see below), whose sum is σ = 29473254216. Its totient is φ = 4257280000.
The previous prime is 11310099979. The next prime is 11310100001. The reversal of 11310100000 is 101311.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 7097051536 + 4213048464 = 84244^2 + 64908^2 .
It is not an unprimeable number, because it can be changed into a prime (11310100001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1696674 + ... + 1703326.
Almost surely, 211310100000 is an apocalyptic number.
11310100000 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 11310100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14736627108).
11310100000 is an abundant number, since it is smaller than the sum of its proper divisors (18163154216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11310100000 is an frugal number, since it uses more digits than its factorization.
11310100000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6705 (or 6677 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 11310100000 its reverse (101311), we get a palindrome (11310201311).
The spelling of 11310100000 in words is "eleven billion, three hundred ten million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •