Base | Representation |
---|---|
bin | 1010101110110111001000… |
… | …0100100111010100000101 |
3 | 1112210002100110101022100201 |
4 | 2223231302010213110011 |
5 | 3021313241334134331 |
6 | 41032533150210501 |
7 | 2325351453222055 |
oct | 253556204472405 |
9 | 45702313338321 |
10 | 11800188974341 |
11 | 383a483055949 |
12 | 13a6b574b3a31 |
13 | 6779a3597361 |
14 | 2cb1bca4d565 |
15 | 156e3b378a61 |
hex | abb72127505 |
11800188974341 has 4 divisors (see below), whose sum is σ = 11806039342732. Its totient is φ = 11794338605952.
The previous prime is 11800188974323. The next prime is 11800188974423. The reversal of 11800188974341 is 14347988100811.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5865381641025 + 5934807333316 = 2421855^2 + 2436146^2 .
It is a cyclic number.
It is not a de Polignac number, because 11800188974341 - 233 = 11791599039749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11800188974641) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2925181170 + ... + 2925185203.
It is an arithmetic number, because the mean of its divisors is an integer number (2951509835683).
Almost surely, 211800188974341 is an apocalyptic number.
It is an amenable number.
11800188974341 is a deficient number, since it is larger than the sum of its proper divisors (5850368391).
11800188974341 is an equidigital number, since it uses as much as digits as its factorization.
11800188974341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5850368390.
The product of its (nonzero) digits is 1548288, while the sum is 55.
The spelling of 11800188974341 in words is "eleven trillion, eight hundred billion, one hundred eighty-eight million, nine hundred seventy-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •