Base | Representation |
---|---|
bin | 11101011011001101110… |
… | …00000111101101100011 |
3 | 10120122200100100022020020 |
4 | 32231212320013231203 |
5 | 113031104041132433 |
6 | 2052244502444523 |
7 | 133021411162332 |
oct | 16554670075543 |
9 | 3518610308206 |
10 | 1011043302243 |
11 | 35a86564a367 |
12 | 143b44433743 |
13 | 74458174b00 |
14 | 36d12d89d19 |
15 | 1b47600acb3 |
hex | eb66e07b63 |
1011043302243 has 12 divisors (see below), whose sum is σ = 1459731159000. Its totient is φ = 622180493376.
The previous prime is 1011043302229. The next prime is 1011043302251. The reversal of 1011043302243 is 3422033401101.
It is a happy number.
It is not a de Polignac number, because 1011043302243 - 212 = 1011043298147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1011043302253) 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 11 ways as a sum of consecutive naturals, for example, 997083618 + ... + 997084631.
It is an arithmetic number, because the mean of its divisors is an integer number (121644263250).
Almost surely, 21011043302243 is an apocalyptic number.
1011043302243 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1011043302243 is a deficient number, since it is larger than the sum of its proper divisors (448687856757).
1011043302243 is a wasteful number, since it uses less digits than its factorization.
1011043302243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1994168278 (or 1994168265 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1011043302243 its reverse (3422033401101), we get a palindrome (4433076703344).
The spelling of 1011043302243 in words is "one trillion, eleven billion, forty-three million, three hundred two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •