Base | Representation |
---|---|
bin | 1000001010011001101… |
… | …1111101110001011000 |
3 | 111101221221221020202112 |
4 | 2002212123331301120 |
5 | 4244143203132412 |
6 | 144231003251452 |
7 | 13063030254560 |
oct | 2024633756130 |
9 | 441857836675 |
10 | 140231302232 |
11 | 54520a06a0a |
12 | 23217219b88 |
13 | 102ba788c18 |
14 | 6b0423bda0 |
15 | 39ab1b0722 |
hex | 20a66fdc58 |
140231302232 has 16 divisors (see below), whose sum is σ = 300495647760. Its totient is φ = 60099129504.
The previous prime is 140231302229. The next prime is 140231302241. The reversal of 140231302232 is 232203132041.
140231302232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 140231302198 and 140231302207.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1252065143 + ... + 1252065254.
It is an arithmetic number, because the mean of its divisors is an integer number (18780977985).
Almost surely, 2140231302232 is an apocalyptic number.
It is an amenable number.
140231302232 is an abundant number, since it is smaller than the sum of its proper divisors (160264345528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140231302232 is a wasteful number, since it uses less digits than its factorization.
140231302232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2504130410 (or 2504130406 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 140231302232 its reverse (232203132041), we get a palindrome (372434434273).
The spelling of 140231302232 in words is "one hundred forty billion, two hundred thirty-one million, three hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •