Base | Representation |
---|---|
bin | 1000001011001001111… |
… | …1011010110011010011 |
3 | 111102111001110200211001 |
4 | 2002302133122303103 |
5 | 4300101441043123 |
6 | 144303030002431 |
7 | 13101034226206 |
oct | 2026237326323 |
9 | 442431420731 |
10 | 140433534163 |
11 | 5461508383a |
12 | 23272aa6417 |
13 | 103206450a0 |
14 | 6b2304193d |
15 | 39bdd0b0ad |
hex | 20b27dacd3 |
140433534163 has 4 divisors (see below), whose sum is σ = 151236113728. Its totient is φ = 129630954600.
The previous prime is 140433534161. The next prime is 140433534173. The reversal of 140433534163 is 361435334041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 361435334041 = 89 ⋅4061071169.
It is a cyclic number.
It is not a de Polignac number, because 140433534163 - 21 = 140433534161 is a prime.
It is a super-2 number, since 2×1404335341632 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140433534161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5401289763 + ... + 5401289788.
It is an arithmetic number, because the mean of its divisors is an integer number (37809028432).
Almost surely, 2140433534163 is an apocalyptic number.
140433534163 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
140433534163 is a deficient number, since it is larger than the sum of its proper divisors (10802579565).
140433534163 is a wasteful number, since it uses less digits than its factorization.
140433534163 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10802579564.
The product of its (nonzero) digits is 155520, while the sum is 37.
The spelling of 140433534163 in words is "one hundred forty billion, four hundred thirty-three million, five hundred thirty-four thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •