Base | Representation |
---|---|
bin | 11111111100110110100101… |
… | …100110101101101001000110 |
3 | 200102112200211200001022020220 |
4 | 133330312211212231221012 |
5 | 121404244431143143134 |
6 | 1214510320413405210 |
7 | 41412215625141144 |
oct | 3774664546555106 |
9 | 612480750038226 |
10 | 140521223412294 |
11 | 408577972654aa |
12 | 13915b55499806 |
13 | 605412c836baa |
14 | 269b39909c594 |
15 | 113a42d49d149 |
hex | 7fcda59ada46 |
140521223412294 has 8 divisors (see below), whose sum is σ = 281042446824600. Its totient is φ = 46840407804096.
The previous prime is 140521223412293. The next prime is 140521223412331. The reversal of 140521223412294 is 492214322125041.
It is a sphenic number, since it is the product of 3 distinct primes.
140521223412294 is an admirable number.
It is a super-2 number, since 2×1405212234122942 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140521223412293) 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, 11710101951019 + ... + 11710101951030.
It is an arithmetic number, because the mean of its divisors is an integer number (35130305853075).
Almost surely, 2140521223412294 is an apocalyptic number.
140521223412294 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140521223412294 is a wasteful number, since it uses less digits than its factorization.
140521223412294 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23420203902054.
The product of its (nonzero) digits is 276480, while the sum is 42.
The spelling of 140521223412294 in words is "one hundred forty trillion, five hundred twenty-one billion, two hundred twenty-three million, four hundred twelve thousand, two hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •