Base | Representation |
---|---|
bin | 10000101101010… |
… | …00110011111001 |
3 | 100202201110110221 |
4 | 20112220303321 |
5 | 241334331212 |
6 | 21523540041 |
7 | 3321162403 |
oct | 1026506371 |
9 | 322643427 |
10 | 140152057 |
11 | 72126351 |
12 | 3ab2a621 |
13 | 23061616 |
14 | 14883b73 |
15 | c486807 |
hex | 85a8cf9 |
140152057 has 4 divisors (see below), whose sum is σ = 141840720. Its totient is φ = 138463396.
The previous prime is 140152039. The next prime is 140152069. The reversal of 140152057 is 750251041.
140152057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 750251041 = 3911 ⋅191831.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140152057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140152757) 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, 844207 + ... + 844372.
It is an arithmetic number, because the mean of its divisors is an integer number (35460180).
Almost surely, 2140152057 is an apocalyptic number.
It is an amenable number.
140152057 is a deficient number, since it is larger than the sum of its proper divisors (1688663).
140152057 is an equidigital number, since it uses as much as digits as its factorization.
140152057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1688662.
The product of its (nonzero) digits is 1400, while the sum is 25.
The square root of 140152057 is about 11838.5834034313. The cubic root of 140152057 is about 519.4373314701.
The spelling of 140152057 in words is "one hundred forty million, one hundred fifty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •