Base | Representation |
---|---|
bin | 10100100100001101… |
… | …10101110010011110 |
3 | 1001111110222010210212 |
4 | 22102012311302132 |
5 | 140103021420220 |
6 | 5023335132422 |
7 | 540416443166 |
oct | 122206656236 |
9 | 31443863725 |
10 | 11041201310 |
11 | 4756519a67 |
12 | 2181814112 |
13 | 106c621c19 |
14 | 76a5575a6 |
15 | 4494cc0c5 |
hex | 2921b5c9e |
11041201310 has 32 divisors (see below), whose sum is σ = 21080790432. Its totient is φ = 4149268480.
The previous prime is 11041201271. The next prime is 11041201343. The reversal of 11041201310 is 1310214011.
11041201310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×110412013102 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 38030 + ... + 153390.
It is an arithmetic number, because the mean of its divisors is an integer number (658774701).
Almost surely, 211041201310 is an apocalyptic number.
11041201310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11041201310 is a deficient number, since it is larger than the sum of its proper divisors (10039589122).
11041201310 is a wasteful number, since it uses less digits than its factorization.
11041201310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115948.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11041201310 its reverse (1310214011), we get a palindrome (12351415321).
The spelling of 11041201310 in words is "eleven billion, forty-one million, two hundred one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •