Base | Representation |
---|---|
bin | 11111110101100111101100… |
… | …110001001011010000001111 |
3 | 200100210011221022221101012020 |
4 | 133311213230301023100033 |
5 | 121323124030442143043 |
6 | 1213450121401141223 |
7 | 41331262144354266 |
oct | 3765475461132017 |
9 | 610704838841166 |
10 | 140024201131023 |
11 | 40685a2612a180 |
12 | 1385576578a813 |
13 | 60192c159ba81 |
14 | 26812c95215dd |
15 | 112c53deabe83 |
hex | 7f59ecc4b40f |
140024201131023 has 8 divisors (see below), whose sum is σ = 203671565281536. Its totient is φ = 84863152200600.
The previous prime is 140024201130991. The next prime is 140024201131051. The reversal of 140024201131023 is 320131102420041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140024201131023 - 25 = 140024201130991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140024201130984 and 140024201131002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140024201131063) 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, 2121578804983 + ... + 2121578805048.
It is an arithmetic number, because the mean of its divisors is an integer number (25458945660192).
Almost surely, 2140024201131023 is an apocalyptic number.
140024201131023 is a deficient number, since it is larger than the sum of its proper divisors (63647364150513).
140024201131023 is a wasteful number, since it uses less digits than its factorization.
140024201131023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4243157610045.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 140024201131023 its reverse (320131102420041), we get a palindrome (460155303551064).
The spelling of 140024201131023 in words is "one hundred forty trillion, twenty-four billion, two hundred one million, one hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •