Base | Representation |
---|---|
bin | 10000101110000… |
… | …11011001011101 |
3 | 100202220222212021 |
4 | 20113003121131 |
5 | 241401322312 |
6 | 21530140141 |
7 | 3322125034 |
oct | 1027033135 |
9 | 322828767 |
10 | 140260957 |
11 | 721a0151 |
12 | 3ab81651 |
13 | 2309c065 |
14 | 148b171b |
15 | c4a8c07 |
hex | 85c365d |
140260957 has 4 divisors (see below), whose sum is σ = 144785536. Its totient is φ = 135736380.
The previous prime is 140260943. The next prime is 140260963. The reversal of 140260957 is 759062041.
140260957 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: 759062041 = 233 ⋅3257777.
It is a cyclic number.
It is not a de Polignac number, because 140260957 - 219 = 139736669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140260937) 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, 2262243 + ... + 2262304.
It is an arithmetic number, because the mean of its divisors is an integer number (36196384).
Almost surely, 2140260957 is an apocalyptic number.
It is an amenable number.
140260957 is a deficient number, since it is larger than the sum of its proper divisors (4524579).
140260957 is an equidigital number, since it uses as much as digits as its factorization.
140260957 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4524578.
The product of its (nonzero) digits is 15120, while the sum is 34.
The square root of 140260957 is about 11843.1818781947. The cubic root of 140260957 is about 519.5718331961.
The spelling of 140260957 in words is "one hundred forty million, two hundred sixty thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •