Search a number
-
+
140063162561 = 7283915232237
BaseRepresentation
bin1000001001110001101…
…0100100000011000001
3111101112020112212111022
42002130122210003001
54243322132200221
6144202155355225
713055616144500
oct2023432440301
9441466485438
10140063162561
1154445005103
122318aa52b15
13102919a85aa
146ac9b90837
15399b54b4ab
hex209c6a40c1

140063162561 has 24 divisors (see below), whose sum is σ = 163304890560. Its totient is φ = 119778745632.

The previous prime is 140063162539. The next prime is 140063162611. The reversal of 140063162561 is 165261360041.

It is not a de Polignac number, because 140063162561 - 26 = 140063162497 is a prime.

It is a super-2 number, since 2×1400631625612 (a number of 23 digits) contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (140063162761) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 62610935 + ... + 62613171.

It is an arithmetic number, because the mean of its divisors is an integer number (6804370440).

Almost surely, 2140063162561 is an apocalyptic number.

It is an amenable number.

140063162561 is a deficient number, since it is larger than the sum of its proper divisors (23241727999).

140063162561 is a wasteful number, since it uses less digits than its factorization.

140063162561 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 4613 (or 4606 counting only the distinct ones).

The product of its (nonzero) digits is 25920, while the sum is 35.

The spelling of 140063162561 in words is "one hundred forty billion, sixty-three million, one hundred sixty-two thousand, five hundred sixty-one".

Divisors: 1 7 49 839 1523 2237 5873 10661 15659 41111 74627 109613 1277797 1876843 3406951 8944579 13137901 23848657 62612053 91965307 166940599 2858431889 20009023223 140063162561