Base | Representation |
---|---|
bin | 1000001010011001110… |
… | …0111011111000100001 |
3 | 111101221222102011202002 |
4 | 2002212130323320201 |
5 | 4244143234303031 |
6 | 144231012533345 |
7 | 13063032364361 |
oct | 2024634737041 |
9 | 441858364662 |
10 | 140231556641 |
11 | 54521070070 |
12 | 23217321255 |
13 | 102ba847967 |
14 | 6b042a69a1 |
15 | 39ab210ccb |
hex | 20a673be21 |
140231556641 has 8 divisors (see below), whose sum is σ = 154823012064. Its totient is φ = 125947289920.
The previous prime is 140231556601. The next prime is 140231556653. The reversal of 140231556641 is 146655132041.
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 140231556641 - 214 = 140231540257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140231556595 and 140231556604.
It is not an unprimeable number, because it can be changed into a prime (140231556601) 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, 76796216 + ... + 76798041.
It is an arithmetic number, because the mean of its divisors is an integer number (19352876508).
Almost surely, 2140231556641 is an apocalyptic number.
140231556641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140231556641 is a deficient number, since it is larger than the sum of its proper divisors (14591455423).
140231556641 is a wasteful number, since it uses less digits than its factorization.
140231556641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153594351.
The product of its (nonzero) digits is 86400, while the sum is 38.
Adding to 140231556641 its reverse (146655132041), we get a palindrome (286886688682).
The spelling of 140231556641 in words is "one hundred forty billion, two hundred thirty-one million, five hundred fifty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •