Base | Representation |
---|---|
bin | 1000001011011010110… |
… | …1111111100011010001 |
3 | 111102122222221021200002 |
4 | 2002312231333203101 |
5 | 4300223120313234 |
6 | 144314042135345 |
7 | 13102555143401 |
oct | 2026655774321 |
9 | 442588837602 |
10 | 140504463569 |
11 | 5465111a088 |
12 | 232927b1555 |
13 | 1033224a952 |
14 | 6b2c626801 |
15 | 39c516c27e |
hex | 20b6b7f8d1 |
140504463569 has 2 divisors, whose sum is σ = 140504463570. Its totient is φ = 140504463568.
The previous prime is 140504463503. The next prime is 140504463577. The reversal of 140504463569 is 965364405041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77810313025 + 62694150544 = 278945^2 + 250388^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140504463569 is a prime.
It is a super-2 number, since 2×1405044635692 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (140504463469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70252231784 + 70252231785.
It is an arithmetic number, because the mean of its divisors is an integer number (70252231785).
Almost surely, 2140504463569 is an apocalyptic number.
It is an amenable number.
140504463569 is a deficient number, since it is larger than the sum of its proper divisors (1).
140504463569 is an equidigital number, since it uses as much as digits as its factorization.
140504463569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 140504463569 in words is "one hundred forty billion, five hundred four million, four hundred sixty-three thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •