Base | Representation |
---|---|
bin | 11111110110110001010011… |
… | …100000110011000010010101 |
3 | 200101001201221021210110020121 |
4 | 133312301103200303002111 |
5 | 121330422410440131401 |
6 | 1213550312020231541 |
7 | 41340060516261550 |
oct | 3766612340630225 |
9 | 611051837713217 |
10 | 140103234302101 |
11 | 407064a2309394 |
12 | 13868b4183b5b1 |
13 | 60238a830bb65 |
14 | 2685065b05697 |
15 | 112e61764cca1 |
hex | 7f6c53833095 |
140103234302101 has 8 divisors (see below), whose sum is σ = 169536686886720. Its totient is φ = 113024457924288.
The previous prime is 140103234302063. The next prime is 140103234302137. The reversal of 140103234302101 is 101203432301041.
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 140103234302101 - 243 = 131307141279893 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 (140103234302501) 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, 588669051571 + ... + 588669051808.
It is an arithmetic number, because the mean of its divisors is an integer number (21192085860840).
Almost surely, 2140103234302101 is an apocalyptic number.
It is an amenable number.
140103234302101 is a deficient number, since it is larger than the sum of its proper divisors (29433452584619).
140103234302101 is a wasteful number, since it uses less digits than its factorization.
140103234302101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1177338103403.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 140103234302101 its reverse (101203432301041), we get a palindrome (241306666603142).
The spelling of 140103234302101 in words is "one hundred forty trillion, one hundred three billion, two hundred thirty-four million, three hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •