Base | Representation |
---|---|
bin | 10100100110111101… |
… | …00111101100011101 |
3 | 1001120002021012220000 |
4 | 22103132213230131 |
5 | 140124414243003 |
6 | 5025520244513 |
7 | 541116152403 |
oct | 122336475435 |
9 | 31502235800 |
10 | 11064212253 |
11 | 4768506476 |
12 | 2189470739 |
13 | 107431a973 |
14 | 76d627473 |
15 | 44b5251a3 |
hex | 2937a7b1d |
11064212253 has 10 divisors (see below), whose sum is σ = 16528020894. Its totient is φ = 7376141448.
The previous prime is 11064212251. The next prime is 11064212303. The reversal of 11064212253 is 35221246011.
11064212253 is a `hidden beast` number, since 1 + 1 + 0 + 642 + 12 + 2 + 5 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 10904998329 + 159213924 = 104427^2 + 12618^2 .
It is not a de Polignac number, because 11064212253 - 21 = 11064212251 is a prime.
It is a super-3 number, since 3×110642122533 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11064212251) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 68297526 + ... + 68297687.
Almost surely, 211064212253 is an apocalyptic number.
It is an amenable number.
11064212253 is a deficient number, since it is larger than the sum of its proper divisors (5463808641).
11064212253 is an equidigital number, since it uses as much as digits as its factorization.
11064212253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136595225 (or 136595216 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 11064212253 its reverse (35221246011), we get a palindrome (46285458264).
The spelling of 11064212253 in words is "eleven billion, sixty-four million, two hundred twelve thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •