Base | Representation |
---|---|
bin | 1000001010101110111… |
… | …0111100000000010011 |
3 | 111102012011010210012001 |
4 | 2002223232330000103 |
5 | 4244333430134221 |
6 | 144243500014431 |
7 | 13065156460444 |
oct | 2025356740023 |
9 | 442164123161 |
10 | 140320161811 |
11 | 54567089485 |
12 | 23240b31417 |
13 | 10302ccba5b |
14 | 6b11d6d2cb |
15 | 39b3db4391 |
hex | 20abbbc013 |
140320161811 has 8 divisors (see below), whose sum is σ = 147085457904. Its totient is φ = 133714049280.
The previous prime is 140320161809. The next prime is 140320161829. The reversal of 140320161811 is 118161023041.
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 140320161811 - 21 = 140320161809 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 140320161811.
It is not an unprimeable number, because it can be changed into a prime (140320161871) 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 in 7 ways as a sum of consecutive naturals, for example, 39794086 + ... + 39797611.
It is an arithmetic number, because the mean of its divisors is an integer number (18385682238).
Almost surely, 2140320161811 is an apocalyptic number.
140320161811 is a deficient number, since it is larger than the sum of its proper divisors (6765296093).
140320161811 is an equidigital number, since it uses as much as digits as its factorization.
140320161811 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79591781.
The product of its (nonzero) digits is 1152, while the sum is 28.
Adding to 140320161811 its reverse (118161023041), we get a palindrome (258481184852).
The spelling of 140320161811 in words is "one hundred forty billion, three hundred twenty million, one hundred sixty-one thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •