Base | Representation |
---|---|
bin | 100001010100011100000001… |
… | …010101011101101100000101 |
3 | 201012212002101100211110121201 |
4 | 201110130001111131230011 |
5 | 123201402420430413234 |
6 | 1235355315120142501 |
7 | 42603111044333116 |
oct | 4124340125355405 |
9 | 635762340743551 |
10 | 146540011576069 |
11 | 427682a7276431 |
12 | 14528529467a31 |
13 | 639c882494857 |
14 | 282880824220d |
15 | 11e1c96ac9314 |
hex | 85470155db05 |
146540011576069 has 2 divisors, whose sum is σ = 146540011576070. Its totient is φ = 146540011576068.
The previous prime is 146540011576067. The next prime is 146540011576159. The reversal of 146540011576069 is 960675110045641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 140096222250625 + 6443789325444 = 11836225^2 + 2538462^2 .
It is a cyclic number.
It is not a de Polignac number, because 146540011576069 - 21 = 146540011576067 is a prime.
It is a super-2 number, since 2×1465400115760692 (a number of 29 digits) contains 22 as substring.
Together with 146540011576067, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146540011576067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73270005788034 + 73270005788035.
It is an arithmetic number, because the mean of its divisors is an integer number (73270005788035).
Almost surely, 2146540011576069 is an apocalyptic number.
It is an amenable number.
146540011576069 is a deficient number, since it is larger than the sum of its proper divisors (1).
146540011576069 is an equidigital number, since it uses as much as digits as its factorization.
146540011576069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5443200, while the sum is 55.
The spelling of 146540011576069 in words is "one hundred forty-six trillion, five hundred forty billion, eleven million, five hundred seventy-six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •