Base | Representation |
---|---|
bin | 1000001011010000010… |
… | …1111111010100100011 |
3 | 111102112221001202120222 |
4 | 2002310011333110203 |
5 | 4300130332004220 |
6 | 144305430153255 |
7 | 13101511614524 |
oct | 2026405772443 |
9 | 442487052528 |
10 | 140460422435 |
11 | 54629279353 |
12 | 2327bab282b |
13 | 1032609a8c8 |
14 | 6b2684084b |
15 | 39c136ce25 |
hex | 20b417f523 |
140460422435 has 4 divisors (see below), whose sum is σ = 168552506928. Its totient is φ = 112368337944.
The previous prime is 140460422419. The next prime is 140460422437. The reversal of 140460422435 is 534224064041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 534224064041 = 11789 ⋅45315469.
It is a cyclic number.
It is not a de Polignac number, because 140460422435 - 24 = 140460422419 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140460422395 and 140460422404.
It is not an unprimeable number, because it can be changed into a prime (140460422437) 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, 14046042239 + ... + 14046042248.
It is an arithmetic number, because the mean of its divisors is an integer number (42138126732).
Almost surely, 2140460422435 is an apocalyptic number.
140460422435 is a deficient number, since it is larger than the sum of its proper divisors (28092084493).
140460422435 is an equidigital number, since it uses as much as digits as its factorization.
140460422435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28092084492.
The product of its (nonzero) digits is 92160, while the sum is 35.
Adding to 140460422435 its reverse (534224064041), we get a palindrome (674684486476).
The spelling of 140460422435 in words is "one hundred forty billion, four hundred sixty million, four hundred twenty-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •