Base | Representation |
---|---|
bin | 1000001011001001100… |
… | …1101001111101101001 |
3 | 111102110221121221102220 |
4 | 2002302121221331221 |
5 | 4300101044222101 |
6 | 144302533344253 |
7 | 13101015334515 |
oct | 2026231517551 |
9 | 442427557386 |
10 | 140432023401 |
11 | 5461424177a |
12 | 23272498089 |
13 | 10320236547 |
14 | 6b22b6b145 |
15 | 39bdb0d636 |
hex | 20b2669f69 |
140432023401 has 8 divisors (see below), whose sum is σ = 193282785024. Its totient is φ = 90601305360.
The previous prime is 140432023399. The next prime is 140432023439. The reversal of 140432023401 is 104320234041.
140432023401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140432023401 - 21 = 140432023399 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140432027401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 755010786 + ... + 755010971.
It is an arithmetic number, because the mean of its divisors is an integer number (24160348128).
Almost surely, 2140432023401 is an apocalyptic number.
It is an amenable number.
140432023401 is a deficient number, since it is larger than the sum of its proper divisors (52850761623).
140432023401 is a wasteful number, since it uses less digits than its factorization.
140432023401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1510021791.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 140432023401 its reverse (104320234041), we get a palindrome (244752257442).
The spelling of 140432023401 in words is "one hundred forty billion, four hundred thirty-two million, twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •