Base | Representation |
---|---|
bin | 10101010101001100… |
… | …00101000001000011 |
3 | 1002120010001002010000 |
4 | 22222212011001003 |
5 | 141423210341311 |
6 | 5132213011043 |
7 | 553535522301 |
oct | 125246050103 |
9 | 32503032100 |
10 | 11452043331 |
11 | 494741a723 |
12 | 2277323a83 |
13 | 110678b401 |
14 | 7a8d41271 |
15 | 4705d3056 |
hex | 2aa985043 |
11452043331 has 10 divisors (see below), whose sum is σ = 17107373492. Its totient is φ = 7634695500.
The previous prime is 11452043293. The next prime is 11452043347. The reversal of 11452043331 is 13334025411.
It is a happy number.
It is not a de Polignac number, because 11452043331 - 210 = 11452042307 is a prime.
It is a super-2 number, since 2×114520433312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11452043295 and 11452043304.
It is not an unprimeable number, because it can be changed into a prime (11452043381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 70691545 + ... + 70691706.
Almost surely, 211452043331 is an apocalyptic number.
11452043331 is a deficient number, since it is larger than the sum of its proper divisors (5655330161).
11452043331 is an equidigital number, since it uses as much as digits as its factorization.
11452043331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141383263 (or 141383254 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 11452043331 its reverse (13334025411), we get a palindrome (24786068742).
The spelling of 11452043331 in words is "eleven billion, four hundred fifty-two million, forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •