Base | Representation |
---|---|
bin | 1000001010110100100… |
… | …0001000111001001101 |
3 | 111102020210010210110200 |
4 | 2002231020020321031 |
5 | 4244410421423141 |
6 | 144250053124113 |
7 | 13065562311312 |
oct | 2025510107115 |
9 | 442223123420 |
10 | 140343545421 |
11 | 545792aa982 |
12 | 23248929639 |
13 | 10307ac8301 |
14 | 6b150d8d09 |
15 | 39b5e82ab6 |
hex | 20ad208e4d |
140343545421 has 12 divisors (see below), whose sum is σ = 202731974172. Its totient is φ = 93556123776.
The previous prime is 140343545413. The next prime is 140343545437. The reversal of 140343545421 is 124545343041.
140343545421 is a `hidden beast` number, since 1 + 40 + 34 + 3 + 545 + 42 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 94058756100 + 46284789321 = 306690^2 + 215139^2 .
It is not a de Polignac number, because 140343545421 - 23 = 140343545413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140343545021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 375426 + ... + 649331.
It is an arithmetic number, because the mean of its divisors is an integer number (16894331181).
Almost surely, 2140343545421 is an apocalyptic number.
It is an amenable number.
140343545421 is a deficient number, since it is larger than the sum of its proper divisors (62388428751).
140343545421 is a wasteful number, since it uses less digits than its factorization.
140343545421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1039980 (or 1039977 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 36.
Adding to 140343545421 its reverse (124545343041), we get a palindrome (264888888462).
The spelling of 140343545421 in words is "one hundred forty billion, three hundred forty-three million, five hundred forty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •