Base | Representation |
---|---|
bin | 10101010101001100… |
… | …10110000111000111 |
3 | 1002120010011122011100 |
4 | 22222212112013013 |
5 | 141423220111401 |
6 | 5132214311143 |
7 | 553536233400 |
oct | 125246260707 |
9 | 32503148140 |
10 | 11452113351 |
11 | 4947468298 |
12 | 22773584b3 |
13 | 11067b4243 |
14 | 7a8d5c9a7 |
15 | 4705e8b86 |
hex | 2aa9961c7 |
11452113351 has 36 divisors (see below), whose sum is σ = 19354024872. Its totient is φ = 6506194464.
The previous prime is 11452113289. The next prime is 11452113377. The reversal of 11452113351 is 15331125411.
11452113351 is a `hidden beast` number, since 1 + 1 + 4 + 521 + 133 + 5 + 1 = 666.
11452113351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11452113351 - 210 = 11452112327 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11452114351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1240 + ... + 151346.
It is an arithmetic number, because the mean of its divisors is an integer number (537611802).
Almost surely, 211452113351 is an apocalyptic number.
11452113351 is a deficient number, since it is larger than the sum of its proper divisors (7901911521).
11452113351 is a wasteful number, since it uses less digits than its factorization.
11452113351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150300 (or 150290 counting only the distinct ones).
The product of its digits is 1800, while the sum is 27.
Adding to 11452113351 its reverse (15331125411), we get a palindrome (26783238762).
The spelling of 11452113351 in words is "eleven billion, four hundred fifty-two million, one hundred thirteen thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •