Base | Representation |
---|---|
bin | 10101010101000111… |
… | …10100111111111001 |
3 | 1002120001221002220221 |
4 | 22222203310333321 |
5 | 141423033002213 |
6 | 5132152220041 |
7 | 553530514420 |
oct | 125243647771 |
9 | 32501832827 |
10 | 11451453433 |
11 | 4947057502 |
12 | 227709a621 |
13 | 1106612a64 |
14 | 7a8c2a2b7 |
15 | 47051838d |
hex | 2aa8f4ff9 |
11451453433 has 4 divisors (see below), whose sum is σ = 13087375360. Its totient is φ = 9815531508.
The previous prime is 11451453421. The next prime is 11451453473. The reversal of 11451453433 is 33435415411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 33435415411 = 29 ⋅1152945359.
It is a cyclic number.
It is not a de Polignac number, because 11451453433 - 29 = 11451452921 is a prime.
It is a super-2 number, since 2×114514534332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11451453473) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 817960953 + ... + 817960966.
It is an arithmetic number, because the mean of its divisors is an integer number (3271843840).
Almost surely, 211451453433 is an apocalyptic number.
It is an amenable number.
11451453433 is a deficient number, since it is larger than the sum of its proper divisors (1635921927).
11451453433 is an equidigital number, since it uses as much as digits as its factorization.
11451453433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1635921926.
The product of its digits is 43200, while the sum is 34.
Adding to 11451453433 its reverse (33435415411), we get a palindrome (44886868844).
The spelling of 11451453433 in words is "eleven billion, four hundred fifty-one million, four hundred fifty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •