Base | Representation |
---|---|
bin | 11111111100101000101111… |
… | …101101110000100111101111 |
3 | 200102111021110212010112222220 |
4 | 133330220233231300213233 |
5 | 121404024011311134002 |
6 | 1214455421521010423 |
7 | 41411151412541310 |
oct | 3774505755604757 |
9 | 612437425115886 |
10 | 140506360646127 |
11 | 4085145a656283 |
12 | 139130a7a83a13 |
13 | 605290156a0b8 |
14 | 269a78919c607 |
15 | 1139d5d7457bc |
hex | 7fca2fb709ef |
140506360646127 has 16 divisors (see below), whose sum is σ = 214108204027392. Its totient is φ = 80288121371040.
The previous prime is 140506360646033. The next prime is 140506360646131. The reversal of 140506360646127 is 721646063605041.
It is not a de Polignac number, because 140506360646127 - 212 = 140506360642031 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140506360646127.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140506360646027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49741624 + ... + 52490397.
It is an arithmetic number, because the mean of its divisors is an integer number (13381762751712).
Almost surely, 2140506360646127 is an apocalyptic number.
140506360646127 is a deficient number, since it is larger than the sum of its proper divisors (73601843381265).
140506360646127 is a wasteful number, since it uses less digits than its factorization.
140506360646127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102297478.
The product of its (nonzero) digits is 4354560, while the sum is 51.
The spelling of 140506360646127 in words is "one hundred forty trillion, five hundred six billion, three hundred sixty million, six hundred forty-six thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •