Base | Representation |
---|---|
bin | 11111110101100101111100… |
… | …101101001000100000011001 |
3 | 200100210000002022011222211210 |
4 | 133311211330231020200121 |
5 | 121323111203140214001 |
6 | 1213445211040013333 |
7 | 41331164434613634 |
oct | 3765457455104031 |
9 | 610700068158753 |
10 | 140022321023001 |
11 | 4068515093019a |
12 | 13855320001249 |
13 | 6019081c11411 |
14 | 268118b954c1b |
15 | 112c47ddccdd6 |
hex | 7f597cb48819 |
140022321023001 has 8 divisors (see below), whose sum is σ = 189482941882144. Its totient is φ = 91954957089600.
The previous prime is 140022321022979. The next prime is 140022321023027. The reversal of 140022321023001 is 100320123220041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140022321023001 - 210 = 140022321021977 is a prime.
It is a super-2 number, since 2×1400223210230012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140022321423001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 348314231200 + ... + 348314231601.
It is an arithmetic number, because the mean of its divisors is an integer number (23685367735268).
Almost surely, 2140022321023001 is an apocalyptic number.
It is an amenable number.
140022321023001 is a deficient number, since it is larger than the sum of its proper divisors (49460620859143).
140022321023001 is an equidigital number, since it uses as much as digits as its factorization.
140022321023001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696628462871.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 140022321023001 its reverse (100320123220041), we get a palindrome (240342444243042).
The spelling of 140022321023001 in words is "one hundred forty trillion, twenty-two billion, three hundred twenty-one million, twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •