Base | Representation |
---|---|
bin | 1010011010100010110010… |
… | …1111101100101101100111 |
3 | 1111112201101011221121211102 |
4 | 2212220230233230231213 |
5 | 3000103410134400201 |
6 | 40204324512230315 |
7 | 2261213522601365 |
oct | 246505457545547 |
9 | 44481334847742 |
10 | 11451133512551 |
11 | 3715442379097 |
12 | 134b38153b39b |
13 | 650ab65b77a5 |
14 | 2b834880c635 |
15 | 14cd0c1ed26b |
hex | a6a2cbecb67 |
11451133512551 has 4 divisors (see below), whose sum is σ = 11505404287704. Its totient is φ = 11396862737400.
The previous prime is 11451133512503. The next prime is 11451133512589. The reversal of 11451133512551 is 15521533115411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11451133512551 - 26 = 11451133512487 is a prime.
It is a super-2 number, since 2×114511335125512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11451133511551) 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, 27135387260 + ... + 27135387681.
It is an arithmetic number, because the mean of its divisors is an integer number (2876351071926).
Almost surely, 211451133512551 is an apocalyptic number.
11451133512551 is a deficient number, since it is larger than the sum of its proper divisors (54270775153).
11451133512551 is an equidigital number, since it uses as much as digits as its factorization.
11451133512551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54270775152.
The product of its digits is 45000, while the sum is 38.
Adding to 11451133512551 its reverse (15521533115411), we get a palindrome (26972666627962).
The spelling of 11451133512551 in words is "eleven trillion, four hundred fifty-one billion, one hundred thirty-three million, five hundred twelve thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •