Base | Representation |
---|---|
bin | 10100100100001101… |
… | …11100111010100101 |
3 | 1001111111000121212000 |
4 | 22102012330322211 |
5 | 140103023334001 |
6 | 5023335515513 |
7 | 540416624250 |
oct | 122206747245 |
9 | 31444017760 |
10 | 11041230501 |
11 | 4756539994 |
12 | 2181828b99 |
13 | 106c6322b2 |
14 | 76a564097 |
15 | 4494d5a86 |
hex | 2921bcea5 |
11041230501 has 32 divisors (see below), whose sum is σ = 18730195200. Its totient is φ = 6297108480.
The previous prime is 11041230493. The next prime is 11041230517. The reversal of 11041230501 is 10503214011.
11041230501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11041230501 - 23 = 11041230493 is a prime.
It is a super-2 number, since 2×110412305012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11041235501) 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 31 ways as a sum of consecutive naturals, for example, 42405 + ... + 154533.
It is an arithmetic number, because the mean of its divisors is an integer number (585318600).
Almost surely, 211041230501 is an apocalyptic number.
It is an amenable number.
11041230501 is a deficient number, since it is larger than the sum of its proper divisors (7688964699).
11041230501 is a wasteful number, since it uses less digits than its factorization.
11041230501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112666 (or 112660 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 11041230501 its reverse (10503214011), we get a palindrome (21544444512).
The spelling of 11041230501 in words is "eleven billion, forty-one million, two hundred thirty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •