Base | Representation |
---|---|
bin | 1000001011111000001… |
… | …1110101011111100011 |
3 | 111102222120200210022122 |
4 | 2002332003311133203 |
5 | 4301001133130201 |
6 | 144334202054455 |
7 | 13105612063346 |
oct | 2027603653743 |
9 | 442876623278 |
10 | 140627630051 |
11 | 547046a3967 |
12 | 23307aaa42b |
13 | 10351912c1c |
14 | 6b40b2845d |
15 | 39d0d9ae1b |
hex | 20be0f57e3 |
140627630051 has 4 divisors (see below), whose sum is σ = 140639778312. Its totient is φ = 140615481792.
The previous prime is 140627630021. The next prime is 140627630081. The reversal of 140627630051 is 150036726041.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (140627630021) and next prime (140627630081).
It is a cyclic number.
It is not a de Polignac number, because 140627630051 - 210 = 140627629027 is a prime.
It is a super-2 number, since 2×1406276300512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140627629993 and 140627630020.
It is not an unprimeable number, because it can be changed into a prime (140627630021) 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, 6056750 + ... + 6079923.
It is an arithmetic number, because the mean of its divisors is an integer number (35159944578).
Almost surely, 2140627630051 is an apocalyptic number.
140627630051 is a deficient number, since it is larger than the sum of its proper divisors (12148261).
140627630051 is a wasteful number, since it uses less digits than its factorization.
140627630051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12148260.
The product of its (nonzero) digits is 30240, while the sum is 35.
The spelling of 140627630051 in words is "one hundred forty billion, six hundred twenty-seven million, six hundred thirty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •