Base | Representation |
---|---|
bin | 10101011110111101… |
… | …11010011110101001 |
3 | 1002202211100111211000 |
4 | 22233132322132221 |
5 | 142110204114431 |
6 | 5144302425213 |
7 | 555552550356 |
oct | 125736723651 |
9 | 32684314730 |
10 | 11534051241 |
11 | 4989742459 |
12 | 229a892209 |
13 | 111a7726bb |
14 | 7b5bab62d |
15 | 4778d19e6 |
hex | 2af7ba7a9 |
11534051241 has 8 divisors (see below), whose sum is σ = 17087483360. Its totient is φ = 7689367476.
The previous prime is 11534051231. The next prime is 11534051257. The reversal of 11534051241 is 14215043511.
11534051241 is a `hidden beast` number, since 1 + 1 + 534 + 0 + 5 + 124 + 1 = 666.
It is not a de Polignac number, because 11534051241 - 218 = 11533789097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 427187083 = 11534051241 / (1 + 1 + 5 + 3 + 4 + 0 + 5 + 1 + 2 + 4 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11534051231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 213593515 + ... + 213593568.
It is an arithmetic number, because the mean of its divisors is an integer number (2135935420).
Almost surely, 211534051241 is an apocalyptic number.
It is an amenable number.
11534051241 is a deficient number, since it is larger than the sum of its proper divisors (5553432119).
11534051241 is an equidigital number, since it uses as much as digits as its factorization.
11534051241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 427187092 (or 427187086 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 11534051241 its reverse (14215043511), we get a palindrome (25749094752).
The spelling of 11534051241 in words is "eleven billion, five hundred thirty-four million, fifty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •