Base | Representation |
---|---|
bin | 10100101100100011… |
… | …11000011001000101 |
3 | 1001200100200200000200 |
4 | 22112101320121011 |
5 | 140223432020141 |
6 | 5034315401113 |
7 | 542226451662 |
oct | 122621703105 |
9 | 31610620020 |
10 | 11111204421 |
11 | 4791a92379 |
12 | 21a1153199 |
13 | 1080c91c95 |
14 | 77597aa69 |
15 | 450708ab6 |
hex | 296478645 |
11111204421 has 12 divisors (see below), whose sum is σ = 16097146572. Its totient is φ = 7385486976.
The previous prime is 11111204411. The next prime is 11111204453. The reversal of 11111204421 is 12440211111.
11111204421 is a `hidden beast` number, since 111 + 112 + 0 + 442 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1685513025 + 9425691396 = 41055^2 + 97086^2 .
It is a de Polignac number, because none of the positive numbers 2k-11111204421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11111204394 and 11111204403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11111204411) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1828686 + ... + 1834751.
It is an arithmetic number, because the mean of its divisors is an integer number (1341428881).
Almost surely, 211111204421 is an apocalyptic number.
It is an amenable number.
11111204421 is a deficient number, since it is larger than the sum of its proper divisors (4985942151).
11111204421 is a wasteful number, since it uses less digits than its factorization.
11111204421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3663780 (or 3663777 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11111204421 its reverse (12440211111), we get a palindrome (23551415532).
The spelling of 11111204421 in words is "eleven billion, one hundred eleven million, two hundred four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •