Base | Representation |
---|---|
bin | 10100100010000011… |
… | …11010001010111001 |
3 | 1001110012222002110000 |
4 | 22101001322022321 |
5 | 140033410200241 |
6 | 5021451543213 |
7 | 540110033046 |
oct | 122101721271 |
9 | 31405862400 |
10 | 11023131321 |
11 | 47472a7794 |
12 | 217775ab09 |
13 | 1068966117 |
14 | 767db21cd |
15 | 447b0ceb6 |
hex | 29107a2b9 |
11023131321 has 10 divisors (see below), whose sum is σ = 16466653082. Its totient is φ = 7348754160.
The previous prime is 11023131319. The next prime is 11023131367. The reversal of 11023131321 is 12313132011.
11023131321 is a `hidden beast` number, since 110 + 231 + 3 + 1 + 321 = 666.
It can be written as a sum of positive squares in only one way, i.e., 10938858921 + 84272400 = 104589^2 + 9180^2 .
It is not a de Polignac number, because 11023131321 - 21 = 11023131319 is a prime.
It is a super-2 number, since 2×110231313212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11023131294 and 11023131303.
It is not an unprimeable number, because it can be changed into a prime (11023131121) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 68043940 + ... + 68044101.
Almost surely, 211023131321 is an apocalyptic number.
It is an amenable number.
11023131321 is a deficient number, since it is larger than the sum of its proper divisors (5443521761).
11023131321 is an equidigital number, since it uses as much as digits as its factorization.
11023131321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136088053 (or 136088044 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 11023131321 its reverse (12313132011), we get a palindrome (23336263332).
The spelling of 11023131321 in words is "eleven billion, twenty-three million, one hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •