Base | Representation |
---|---|
bin | 1010000010000010101100… |
… | …1011010100100011101001 |
3 | 1110001110212122001011120100 |
4 | 2200200223023110203221 |
5 | 2421204322300413301 |
6 | 35243112031020013 |
7 | 2215622435322066 |
oct | 240405313244351 |
9 | 43043778034510 |
10 | 11030200404201 |
11 | 3572977631650 |
12 | 12a188796a609 |
13 | 6201b3185404 |
14 | 2a1c16469c6d |
15 | 141dc2bbc286 |
hex | a082b2d48e9 |
11030200404201 has 48 divisors (see below), whose sum is σ = 18684977725440. Its totient is φ = 6198381934560.
The previous prime is 11030200404173. The next prime is 11030200404211. The reversal of 11030200404201 is 10240400203011.
11030200404201 is a `hidden beast` number, since 1 + 1 + 0 + 3 + 0 + 200 + 40 + 420 + 1 = 666.
It is not a de Polignac number, because 11030200404201 - 26 = 11030200404137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11030200404211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 62294665 + ... + 62471478.
It is an arithmetic number, because the mean of its divisors is an integer number (389270369280).
Almost surely, 211030200404201 is an apocalyptic number.
11030200404201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11030200404201 is a deficient number, since it is larger than the sum of its proper divisors (7654777321239).
11030200404201 is a wasteful number, since it uses less digits than its factorization.
11030200404201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124766226 (or 124766223 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 11030200404201 its reverse (10240400203011), we get a palindrome (21270600607212).
The spelling of 11030200404201 in words is "eleven trillion, thirty billion, two hundred million, four hundred four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •