Base | Representation |
---|---|
bin | 10100111100010011… |
… | …10010010110010011 |
3 | 1002000120020211102112 |
4 | 22132021302112103 |
5 | 141011241101433 |
6 | 5055354535535 |
7 | 545422322000 |
oct | 123611622623 |
9 | 32016224375 |
10 | 11243300243 |
11 | 484a60597a |
12 | 22194375ab |
13 | 10a24626a6 |
14 | 7893248a7 |
15 | 45c0ed348 |
hex | 29e272593 |
11243300243 has 16 divisors (see below), whose sum is σ = 13681804800. Its totient is φ = 9218103048.
The previous prime is 11243300227. The next prime is 11243300279. The reversal of 11243300243 is 34200334211.
11243300243 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 11243300243 - 24 = 11243300227 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11243300143) 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 15 ways as a sum of consecutive naturals, for example, 704705 + ... + 720482.
It is an arithmetic number, because the mean of its divisors is an integer number (855112800).
Almost surely, 211243300243 is an apocalyptic number.
11243300243 is a deficient number, since it is larger than the sum of its proper divisors (2438504557).
11243300243 is an equidigital number, since it uses as much as digits as its factorization.
11243300243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1425231 (or 1425217 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 11243300243 its reverse (34200334211), we get a palindrome (45443634454).
The spelling of 11243300243 in words is "eleven billion, two hundred forty-three million, three hundred thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •