Base | Representation |
---|---|
bin | 1000001010011010111… |
… | …1100111011011101101 |
3 | 111101222022121222010102 |
4 | 2002212233213123231 |
5 | 4244201013003423 |
6 | 144231305520445 |
7 | 13063122121304 |
oct | 2024657473355 |
9 | 441868558112 |
10 | 140236453613 |
11 | 54523905253 |
12 | 23218aa3125 |
13 | 102bb870889 |
14 | 6b04bbd43b |
15 | 39ab87bc28 |
hex | 20a6be76ed |
140236453613 has 8 divisors (see below), whose sum is σ = 141705736632. Its totient is φ = 138773629696.
The previous prime is 140236453589. The next prime is 140236453673. The reversal of 140236453613 is 316354632041.
It can be written as a sum of positive squares in 4 ways, for example, as 35012771689 + 105223681924 = 187117^2 + 324382^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140236453613 is a prime.
It is a super-2 number, since 2×1402364536132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140236453673) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1571120 + ... + 1657977.
It is an arithmetic number, because the mean of its divisors is an integer number (17713217079).
Almost surely, 2140236453613 is an apocalyptic number.
It is an amenable number.
140236453613 is a deficient number, since it is larger than the sum of its proper divisors (1469283019).
140236453613 is a wasteful number, since it uses less digits than its factorization.
140236453613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3229551.
The product of its (nonzero) digits is 155520, while the sum is 38.
The spelling of 140236453613 in words is "one hundred forty billion, two hundred thirty-six million, four hundred fifty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •