Base | Representation |
---|---|
bin | 1000001010101100100… |
… | …0001110000110101111 |
3 | 111102011110001010201112 |
4 | 2002223020032012233 |
5 | 4244323330343320 |
6 | 144242454302235 |
7 | 13065004266233 |
oct | 2025310160657 |
9 | 442143033645 |
10 | 140310012335 |
11 | 54561386a89 |
12 | 2323965797b |
13 | 10300b8714c |
14 | 6b1088a5c3 |
15 | 39b305bec5 |
hex | 20ab20e1af |
140310012335 has 8 divisors (see below), whose sum is σ = 168405578496. Its totient is φ = 112225634080.
The previous prime is 140310012313. The next prime is 140310012379. The reversal of 140310012335 is 533210013041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140310012335 - 28 = 140310012079 is a prime.
It is a super-2 number, since 2×1403100123352 (a number of 23 digits) contains 22 as substring.
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 140310012335.
It is a congruent number.
It is an unprimeable number.
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, 2769359 + ... + 2819568.
It is an arithmetic number, because the mean of its divisors is an integer number (21050697312).
Almost surely, 2140310012335 is an apocalyptic number.
140310012335 is a deficient number, since it is larger than the sum of its proper divisors (28095566161).
140310012335 is an equidigital number, since it uses as much as digits as its factorization.
140310012335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5593953.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 140310012335 its reverse (533210013041), we get a palindrome (673520025376).
The spelling of 140310012335 in words is "one hundred forty billion, three hundred ten million, twelve thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •