Base | Representation |
---|---|
bin | 1000001011111110100… |
… | …1111110001011101011 |
3 | 111110001110002001201122 |
4 | 2002333221332023223 |
5 | 4301030011414311 |
6 | 144341000005455 |
7 | 13106355465440 |
oct | 2027751761353 |
9 | 443043061648 |
10 | 140654404331 |
11 | 54718820871 |
12 | 23314a6088b |
13 | 103573288ac |
14 | 6b444d79c7 |
15 | 39d33d90db |
hex | 20bfa7e2eb |
140654404331 has 8 divisors (see below), whose sum is σ = 160792411104. Its totient is φ = 120527527680.
The previous prime is 140654404273. The next prime is 140654404349. The reversal of 140654404331 is 133404456041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140654404331 - 226 = 140587295467 is a prime.
It is a super-2 number, since 2×1406544043312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140654404291 and 140654404300.
It is not an unprimeable number, because it can be changed into a prime (140654404361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2755430 + ... + 2806011.
It is an arithmetic number, because the mean of its divisors is an integer number (20099051388).
Almost surely, 2140654404331 is an apocalyptic number.
140654404331 is a deficient number, since it is larger than the sum of its proper divisors (20138006773).
140654404331 is an equidigital number, since it uses as much as digits as its factorization.
140654404331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5565061.
The product of its (nonzero) digits is 69120, while the sum is 35.
The spelling of 140654404331 in words is "one hundred forty billion, six hundred fifty-four million, four hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •