Base | Representation |
---|---|
bin | 1000001011110100110… |
… | …1011011000101010101 |
3 | 111102221120212002212012 |
4 | 2002331031123011111 |
5 | 4300434010203401 |
6 | 144332532234005 |
7 | 13105346614445 |
oct | 2027515330525 |
9 | 442846762765 |
10 | 140613366101 |
11 | 546a764117a |
12 | 2330316b905 |
13 | 1034b98a610 |
14 | 6b3cc94125 |
15 | 39ce9ce8bb |
hex | 20bd35b155 |
140613366101 has 8 divisors (see below), whose sum is σ = 159399767520. Its totient is φ = 122965534512.
The previous prime is 140613366097. The next prime is 140613366121. The reversal of 140613366101 is 101663316041.
140613366101 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 a cyclic number.
It is not a de Polignac number, because 140613366101 - 22 = 140613366097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140613366121) 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, 284642195 + ... + 284642688.
It is an arithmetic number, because the mean of its divisors is an integer number (19924970940).
Almost surely, 2140613366101 is an apocalyptic number.
It is an amenable number.
140613366101 is a deficient number, since it is larger than the sum of its proper divisors (18786401419).
140613366101 is a wasteful number, since it uses less digits than its factorization.
140613366101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569284915.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 140613366101 in words is "one hundred forty billion, six hundred thirteen million, three hundred sixty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •