Base | Representation |
---|---|
bin | 100001001110111011000100… |
… | …100111000001010100101101 |
3 | 201011111212011212202112001222 |
4 | 201032323010213001110231 |
5 | 123124200300111140003 |
6 | 1234505241450513125 |
7 | 42533533501150265 |
oct | 4116730447012455 |
9 | 634455155675058 |
10 | 146161035646253 |
11 | 42631602237151 |
12 | 14486ba31357a5 |
13 | 6372c07748234 |
14 | 281433637a7a5 |
15 | 11d6eb5cd4c38 |
hex | 84eec49c152d |
146161035646253 has 8 divisors (see below), whose sum is σ = 146771822362176. Its totient is φ = 145550284545600.
The previous prime is 146161035646187. The next prime is 146161035646259. The reversal of 146161035646253 is 352646530161641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146161035646253 - 224 = 146161018869037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146161035646195 and 146161035646204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146161035646259) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 662993 + ... + 17110278.
It is an arithmetic number, because the mean of its divisors is an integer number (18346477795272).
Almost surely, 2146161035646253 is an apocalyptic number.
It is an amenable number.
146161035646253 is a deficient number, since it is larger than the sum of its proper divisors (610786715923).
146161035646253 is a wasteful number, since it uses less digits than its factorization.
146161035646253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17807635.
The product of its (nonzero) digits is 9331200, while the sum is 53.
The spelling of 146161035646253 in words is "one hundred forty-six trillion, one hundred sixty-one billion, thirty-five million, six hundred forty-six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.273 sec. • engine limits •