Base | Representation |
---|---|
bin | 10100011111100011… |
… | …01011110111101111 |
3 | 1001101202101122120210 |
4 | 22033301223313233 |
5 | 140013014214411 |
6 | 5015421113503 |
7 | 536433213612 |
oct | 121761536757 |
9 | 31352348523 |
10 | 11002101231 |
11 | 4736443550 |
12 | 21706b8893 |
13 | 10644b1b94 |
14 | 76529a179 |
15 | 445d56ca6 |
hex | 28fc6bdef |
11002101231 has 16 divisors (see below), whose sum is σ = 16004930688. Its totient is φ = 6667159200.
The previous prime is 11002101223. The next prime is 11002101233. The reversal of 11002101231 is 13210120011.
It is not a de Polignac number, because 11002101231 - 23 = 11002101223 is a prime.
It is a super-2 number, since 2×110021012312 (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 (11002101233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 402945 + ... + 429381.
It is an arithmetic number, because the mean of its divisors is an integer number (1000308168).
Almost surely, 211002101231 is an apocalyptic number.
11002101231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11002101231 is a deficient number, since it is larger than the sum of its proper divisors (5002829457).
11002101231 is a wasteful number, since it uses less digits than its factorization.
11002101231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39062.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 11002101231 its reverse (13210120011), we get a palindrome (24212221242).
The spelling of 11002101231 in words is "eleven billion, two million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •