Base | Representation |
---|---|
bin | 110110111101100101… |
… | …0110101100001000001 |
3 | 102021122202022110010111 |
4 | 1231323022311201001 |
5 | 3413211310231301 |
6 | 130120020231321 |
7 | 11345623110556 |
oct | 1557312654101 |
9 | 367582273114 |
10 | 118030555201 |
11 | 46069198099 |
12 | 1aa6023b541 |
13 | b19017a910 |
14 | 59d9962a2d |
15 | 310c12b551 |
hex | 1b7b2b5841 |
118030555201 has 4 divisors (see below), whose sum is σ = 127109828692. Its totient is φ = 108951281712.
The previous prime is 118030555183. The next prime is 118030555241. The reversal of 118030555201 is 102555030811.
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 59780250000 + 58250305201 = 244500^2 + 241351^2 .
It is not a de Polignac number, because 118030555201 - 229 = 117493684289 is a prime.
It is a super-2 number, since 2×1180305552012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (118030555241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4539636726 + ... + 4539636751.
It is an arithmetic number, because the mean of its divisors is an integer number (31777457173).
Almost surely, 2118030555201 is an apocalyptic number.
It is an amenable number.
118030555201 is a deficient number, since it is larger than the sum of its proper divisors (9079273491).
118030555201 is an equidigital number, since it uses as much as digits as its factorization.
118030555201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9079273490.
The product of its (nonzero) digits is 6000, while the sum is 31.
The spelling of 118030555201 in words is "one hundred eighteen billion, thirty million, five hundred fifty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •