Base | Representation |
---|---|
bin | 1000001001100011101… |
… | …0001011111001111111 |
3 | 111101101010212112210201 |
4 | 2002120322023321333 |
5 | 4243212102442143 |
6 | 144152254544331 |
7 | 13054303166230 |
oct | 2023072137177 |
9 | 441333775721 |
10 | 140004343423 |
11 | 5441489044a |
12 | 231732080a7 |
13 | 10282752c79 |
14 | 6ac203d087 |
15 | 39962cd64d |
hex | 2098e8be7f |
140004343423 has 4 divisors (see below), whose sum is σ = 160004963920. Its totient is φ = 120003722928.
The previous prime is 140004343417. The next prime is 140004343499. The reversal of 140004343423 is 324343400041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 324343400041 = 8641 ⋅37535401.
It is a cyclic number.
It is not a de Polignac number, because 140004343423 - 213 = 140004335231 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140004343391 and 140004343400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140004347423) 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, 10000310238 + ... + 10000310251.
It is an arithmetic number, because the mean of its divisors is an integer number (40001240980).
Almost surely, 2140004343423 is an apocalyptic number.
140004343423 is a deficient number, since it is larger than the sum of its proper divisors (20000620497).
140004343423 is an equidigital number, since it uses as much as digits as its factorization.
140004343423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20000620496.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 140004343423 its reverse (324343400041), we get a palindrome (464347743464).
The spelling of 140004343423 in words is "one hundred forty billion, four million, three hundred forty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •