Base | Representation |
---|---|
bin | 10100101011010110… |
… | …00100101110000111 |
3 | 1001122122112211010112 |
4 | 22111223010232013 |
5 | 140213331000203 |
6 | 5033313343235 |
7 | 542044131515 |
oct | 122553045607 |
9 | 31578484115 |
10 | 11101031303 |
11 | 478727413a |
12 | 2199867b1b |
13 | 107bb3c69b |
14 | 77448d4b5 |
15 | 44e8996d8 |
hex | 295ac4b87 |
11101031303 has 8 divisors (see below), whose sum is σ = 11168364000. Its totient is φ = 11033735328.
The previous prime is 11101031269. The next prime is 11101031327. The reversal of 11101031303 is 30313010111.
It is a happy number.
11101031303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11101031303 - 26 = 11101031239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101031363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 821798 + ... + 835196.
It is an arithmetic number, because the mean of its divisors is an integer number (1396045500).
Almost surely, 211101031303 is an apocalyptic number.
11101031303 is a deficient number, since it is larger than the sum of its proper divisors (67332697).
11101031303 is a wasteful number, since it uses less digits than its factorization.
11101031303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18361.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 11101031303 its reverse (30313010111), we get a palindrome (41414041414).
The spelling of 11101031303 in words is "eleven billion, one hundred one million, thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •