Base | Representation |
---|---|
bin | 1000001010010011010… |
… | …0101000011100011001 |
3 | 111101220001222000202012 |
4 | 2002210310220130121 |
5 | 4244114234322131 |
6 | 144224154515305 |
7 | 13062251104343 |
oct | 2024464503431 |
9 | 441801860665 |
10 | 140204214041 |
11 | 54507695181 |
12 | 2320a135b35 |
13 | 102b4c933c8 |
14 | 6b007ca293 |
15 | 39a8b0e52b |
hex | 20a4d28719 |
140204214041 has 4 divisors (see below), whose sum is σ = 141444959412. Its totient is φ = 138963468672.
The previous prime is 140204213921. The next prime is 140204214047. The reversal of 140204214041 is 140412402041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 53397966400 + 86806247641 = 231080^2 + 294629^2 .
It is a cyclic number.
It is not a de Polignac number, because 140204214041 - 222 = 140200019737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140204213998 and 140204214016.
It is not an unprimeable number, because it can be changed into a prime (140204214047) 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, 620372516 + ... + 620372741.
It is an arithmetic number, because the mean of its divisors is an integer number (35361239853).
Almost surely, 2140204214041 is an apocalyptic number.
It is an amenable number.
140204214041 is a deficient number, since it is larger than the sum of its proper divisors (1240745371).
140204214041 is a wasteful number, since it uses less digits than its factorization.
140204214041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1240745370.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 140204214041 its reverse (140412402041), we get a palindrome (280616616082).
The spelling of 140204214041 in words is "one hundred forty billion, two hundred four million, two hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •