Base | Representation |
---|---|
bin | 1000001011110111111… |
… | …0000000010101101011 |
3 | 111102222110211010200202 |
4 | 2002331332000111223 |
5 | 4301000240222421 |
6 | 144334105222415 |
7 | 13105563066302 |
oct | 2027576002553 |
9 | 442873733622 |
10 | 140626101611 |
11 | 5470384a596 |
12 | 23307491a0b |
13 | 103514c9318 |
14 | 6b4084b439 |
15 | 39d0b9810b |
hex | 20bdf8056b |
140626101611 has 8 divisors (see below), whose sum is σ = 148271354880. Its totient is φ = 133005236328.
The previous prime is 140626101601. The next prime is 140626101619. The reversal of 140626101611 is 116101626041.
It is a happy number.
140626101611 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 a de Polignac number, because none of the positive numbers 2k-140626101611 is a prime.
It is not an unprimeable number, because it can be changed into a prime (140626101619) 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, 6085151 + ... + 6108216.
It is an arithmetic number, because the mean of its divisors is an integer number (18533919360).
Almost surely, 2140626101611 is an apocalyptic number.
140626101611 is a deficient number, since it is larger than the sum of its proper divisors (7645253269).
140626101611 is a wasteful number, since it uses less digits than its factorization.
140626101611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12193993.
The product of its (nonzero) digits is 1728, while the sum is 29.
Adding to 140626101611 its reverse (116101626041), we get a palindrome (256727727652).
The spelling of 140626101611 in words is "one hundred forty billion, six hundred twenty-six million, one hundred one thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •