Base | Representation |
---|---|
bin | 10100100010111111… |
… | …11101101011010000 |
3 | 1001110202210100221221 |
4 | 22101133331223100 |
5 | 140042414310000 |
6 | 5022332454424 |
7 | 540234016003 |
oct | 122137755320 |
9 | 31422710857 |
10 | 11031010000 |
11 | 475079909a |
12 | 217a31a414 |
13 | 106a49426a |
14 | 76906353a |
15 | 44866761a |
hex | 2917fdad0 |
11031010000 has 50 divisors (see below), whose sum is σ = 26707202522. Its totient is φ = 4412400000.
The previous prime is 11031009991. The next prime is 11031010007. The reversal of 11031010000 is 1013011.
It is a happy number.
It can be written as a sum of positive squares in 5 ways, for example, as 4868131984 + 6162878016 = 69772^2 + 78504^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11031010007) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 541551 + ... + 561550.
Almost surely, 211031010000 is an apocalyptic number.
11031010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11031010000 is an abundant number, since it is smaller than the sum of its proper divisors (15676192522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11031010000 is an equidigital number, since it uses as much as digits as its factorization.
11031010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1103129 (or 1103108 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 11031010000 its reverse (1013011), we get a palindrome (11032023011).
The spelling of 11031010000 in words is "eleven billion, thirty-one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •