Base | Representation |
---|---|
bin | 11010110101101001011100… |
… | …100100101110000100000001 |
3 | 120110221010010221102020220001 |
4 | 122311221130210232010001 |
5 | 110432344402123432101 |
6 | 1055012530204520001 |
7 | 33601544154535534 |
oct | 3265513444560401 |
9 | 513833127366801 |
10 | 118035844358401 |
11 | 346787a1a52422 |
12 | 112a4179550001 |
13 | 50b296a000738 |
14 | 2120d72cc0a1b |
15 | d9a5b33e3901 |
hex | 6b5a5c92e101 |
118035844358401 has 4 divisors (see below), whose sum is σ = 119970858200404. Its totient is φ = 116100830516400.
The previous prime is 118035844358389. The next prime is 118035844358483. The reversal of 118035844358401 is 104853448530811.
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 11322316468225 + 106713527890176 = 3364865^2 + 10330224^2 .
It is a cyclic number.
It is not a de Polignac number, because 118035844358401 - 233 = 118027254423809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (118035844358101) 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, 967506920910 + ... + 967506921031.
It is an arithmetic number, because the mean of its divisors is an integer number (29992714550101).
Almost surely, 2118035844358401 is an apocalyptic number.
It is an amenable number.
118035844358401 is a deficient number, since it is larger than the sum of its proper divisors (1935013842003).
118035844358401 is an equidigital number, since it uses as much as digits as its factorization.
118035844358401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1935013842002.
The product of its (nonzero) digits is 7372800, while the sum is 55.
The spelling of 118035844358401 in words is "one hundred eighteen trillion, thirty-five billion, eight hundred forty-four million, three hundred fifty-eight thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •