Base | Representation |
---|---|
bin | 1000001010100110111… |
… | …1000010100011010001 |
3 | 111102002211001101221102 |
4 | 2002221233002203101 |
5 | 4244301334243233 |
6 | 144240301234145 |
7 | 13064301500336 |
oct | 2025157024321 |
9 | 442084041842 |
10 | 140286634193 |
11 | 5454a169702 |
12 | 23231862955 |
13 | 102c9090224 |
14 | 6b0b72298d |
15 | 39b0e901e8 |
hex | 20a9bc28d1 |
140286634193 has 8 divisors (see below), whose sum is σ = 140383614888. Its totient is φ = 140189689984.
The previous prime is 140286634181. The next prime is 140286634199. The reversal of 140286634193 is 391436682041.
It can be written as a sum of positive squares in 4 ways, for example, as 90307009 + 140196327184 = 9503^2 + 374428^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140286634193 - 234 = 123106765009 is a prime.
It is a super-4 number, since 4×1402866341934 (a number of 46 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140286634199) 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, 14262005 + ... + 14271837.
It is an arithmetic number, because the mean of its divisors is an integer number (17547951861).
Almost surely, 2140286634193 is an apocalyptic number.
It is an amenable number.
140286634193 is a deficient number, since it is larger than the sum of its proper divisors (96980695).
140286634193 is an equidigital number, since it uses as much as digits as its factorization.
140286634193 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18243.
The product of its (nonzero) digits is 746496, while the sum is 47.
The spelling of 140286634193 in words is "one hundred forty billion, two hundred eighty-six million, six hundred thirty-four thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •