Base | Representation |
---|---|
bin | 10000101100100… |
… | …00011111010011 |
3 | 100202112101211020 |
4 | 20112100133103 |
5 | 241323134220 |
6 | 21521450523 |
7 | 3320266065 |
oct | 1026203723 |
9 | 322471736 |
10 | 140052435 |
11 | 72068516 |
12 | 3aaa0a43 |
13 | 23028183 |
14 | 14859735 |
15 | c467040 |
hex | 85907d3 |
140052435 has 8 divisors (see below), whose sum is σ = 224083920. Its totient is φ = 74694624.
The previous prime is 140052431. The next prime is 140052449. The reversal of 140052435 is 534250041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140052435 - 22 = 140052431 is a prime.
It is a super-2 number, since 2×1400524352 = 39229369098858450, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (140052431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4668400 + ... + 4668429.
It is an arithmetic number, because the mean of its divisors is an integer number (28010490).
Almost surely, 2140052435 is an apocalyptic number.
140052435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
140052435 is a deficient number, since it is larger than the sum of its proper divisors (84031485).
140052435 is an equidigital number, since it uses as much as digits as its factorization.
140052435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9336837.
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 140052435 is about 11834.3751419329. The cubic root of 140052435 is about 519.3142279098.
It can be divided in two parts, 1400 and 52435, that added together give a palindrome (53835).
The spelling of 140052435 in words is "one hundred forty million, fifty-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •