Base | Representation |
---|---|
bin | 101001000010101100100101… |
… | …1000010110111010101101101 |
3 | 1202100020021001021201121012110 |
4 | 1102011121023002313111231 |
5 | 334304243340133441031 |
6 | 3315445523501354233 |
7 | 136020100151212101 |
oct | 12205311302672555 |
9 | 1670207037647173 |
10 | 361010440140141 |
11 | a5035738a33310 |
12 | 345a62a9b68979 |
13 | 126591a519314c |
14 | 6520dd9d8b901 |
15 | 2bb0a9b4c7c46 |
hex | 148564b0b756d |
361010440140141 has 16 divisors (see below), whose sum is σ = 525304472698368. Its totient is φ = 218711548666800.
The previous prime is 361010440140113. The next prime is 361010440140169. The reversal of 361010440140141 is 141041044010163.
It is an interprime number because it is at equal distance from previous prime (361010440140113) and next prime (361010440140169).
It is not a de Polignac number, because 361010440140141 - 210 = 361010440139117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 361010440140099 and 361010440140108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (361010440140101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2066348295 + ... + 2066522996.
It is an arithmetic number, because the mean of its divisors is an integer number (32831529543648).
Almost surely, 2361010440140141 is an apocalyptic number.
It is an amenable number.
361010440140141 is a deficient number, since it is larger than the sum of its proper divisors (164294032558227).
361010440140141 is a wasteful number, since it uses less digits than its factorization.
361010440140141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4132873952.
The product of its (nonzero) digits is 4608, while the sum is 30.
The spelling of 361010440140141 in words is "three hundred sixty-one trillion, ten billion, four hundred forty million, one hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •