Base | Representation |
---|---|
bin | 1000001011110010111… |
… | …0000011010100110100 |
3 | 111102221000101021221212 |
4 | 2002330232003110310 |
5 | 4300424404023244 |
6 | 144332040100552 |
7 | 13105216663433 |
oct | 2027456032464 |
9 | 442830337855 |
10 | 140605142324 |
11 | 546a2a34569 |
12 | 23300464758 |
13 | 1034a06b38a |
14 | 6b3bb5311a |
15 | 39cde07d9e |
hex | 20bcb83534 |
140605142324 has 6 divisors (see below), whose sum is σ = 246058999074. Its totient is φ = 70302571160.
The previous prime is 140605142323. The next prime is 140605142347. The reversal of 140605142324 is 423241506041.
It can be written as a sum of positive squares in only one way, i.e., 121487102500 + 19118039824 = 348550^2 + 138268^2 .
It is a super-2 number, since 2×1406051423242 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140605142323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17575642787 + ... + 17575642794.
It is an arithmetic number, because the mean of its divisors is an integer number (41009833179).
Almost surely, 2140605142324 is an apocalyptic number.
It is an amenable number.
140605142324 is a deficient number, since it is larger than the sum of its proper divisors (105453856750).
140605142324 is a wasteful number, since it uses less digits than its factorization.
140605142324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35151285585 (or 35151285583 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 140605142324 its reverse (423241506041), we get a palindrome (563846648365).
The spelling of 140605142324 in words is "one hundred forty billion, six hundred five million, one hundred forty-two thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •