Base | Representation |
---|---|
bin | 100001000000011000001111… |
… | …010010110100000001010001 |
3 | 201000222022100210101001020221 |
4 | 201000120033102310001101 |
5 | 123011311334140310423 |
6 | 1232422144534033041 |
7 | 42401401545065206 |
oct | 4100301722640121 |
9 | 630868323331227 |
10 | 145161561260113 |
11 | 42286743a82782 |
12 | 143453491a8781 |
13 | 62cc8a4332218 |
14 | 27bbbdda75cad |
15 | 11baeba795e5d |
hex | 84060f4b4051 |
145161561260113 has 8 divisors (see below), whose sum is σ = 149227536227616. Its totient is φ = 141120607677600.
The previous prime is 145161561260041. The next prime is 145161561260119. The reversal of 145161561260113 is 311062165161541.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145161561260113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145161561260113.
It is not an unprimeable number, because it can be changed into a prime (145161561260119) 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, 6255334483 + ... + 6255357688.
It is an arithmetic number, because the mean of its divisors is an integer number (18653442028452).
Almost surely, 2145161561260113 is an apocalyptic number.
It is an amenable number.
145161561260113 is a deficient number, since it is larger than the sum of its proper divisors (4065974967503).
145161561260113 is a wasteful number, since it uses less digits than its factorization.
145161561260113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12510692495.
The product of its (nonzero) digits is 129600, while the sum is 43.
The spelling of 145161561260113 in words is "one hundred forty-five trillion, one hundred sixty-one billion, five hundred sixty-one million, two hundred sixty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •