Base | Representation |
---|---|
bin | 10101010101000111… |
… | …10101010000110001 |
3 | 1002120001221011101221 |
4 | 22222203311100301 |
5 | 141423033021023 |
6 | 5132152225041 |
7 | 553530520522 |
oct | 125243652061 |
9 | 32501834357 |
10 | 11451454513 |
11 | 49470582a4 |
12 | 227709b181 |
13 | 11066133b5 |
14 | 7a8c2a849 |
15 | 47051885d |
hex | 2aa8f5431 |
11451454513 has 4 divisors (see below), whose sum is σ = 11451676480. Its totient is φ = 11451232548.
The previous prime is 11451454501. The next prime is 11451454523. The reversal of 11451454513 is 31545415411.
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: 31545415411 = 11149 ⋅2829439.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11451454513 is a prime.
It is a super-2 number, since 2×114514545132 (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 (11451454523) 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, 11356 + ... + 151762.
It is an arithmetic number, because the mean of its divisors is an integer number (2862919120).
Almost surely, 211451454513 is an apocalyptic number.
It is an amenable number.
11451454513 is a deficient number, since it is larger than the sum of its proper divisors (221967).
11451454513 is an equidigital number, since it uses as much as digits as its factorization.
11451454513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221966.
The product of its digits is 24000, while the sum is 34.
Adding to 11451454513 its reverse (31545415411), we get a palindrome (42996869924).
The spelling of 11451454513 in words is "eleven billion, four hundred fifty-one million, four hundred fifty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •