Base | Representation |
---|---|
bin | 10101000011001101… |
… | …10001011010001111 |
3 | 1002011121020222102100 |
4 | 22201212301122033 |
5 | 141121103331343 |
6 | 5105224330143 |
7 | 550024605033 |
oct | 124146613217 |
9 | 32147228370 |
10 | 11301230223 |
11 | 487a282598 |
12 | 2234913953 |
13 | 10b146639a |
14 | 792cc41c3 |
15 | 4622429d3 |
hex | 2a19b168f |
11301230223 has 12 divisors (see below), whose sum is σ = 16448611608. Its totient is φ = 7476640080.
The previous prime is 11301230183. The next prime is 11301230249. The reversal of 11301230223 is 32203210311.
11301230223 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 11301230223 - 28 = 11301229967 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11301230196 and 11301230205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11301230273) 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 11 ways as a sum of consecutive naturals, for example, 4791540 + ... + 4793897.
It is an arithmetic number, because the mean of its divisors is an integer number (1370717634).
Almost surely, 211301230223 is an apocalyptic number.
11301230223 is a deficient number, since it is larger than the sum of its proper divisors (5147381385).
11301230223 is a wasteful number, since it uses less digits than its factorization.
11301230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9585574 (or 9585571 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 11301230223 its reverse (32203210311), we get a palindrome (43504440534).
The spelling of 11301230223 in words is "eleven billion, three hundred one million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •