Base | Representation |
---|---|
bin | 11111111011101011000010… |
… | …010010001101111111100101 |
3 | 200102020221110001102011020012 |
4 | 133323223002102031333211 |
5 | 121401432311122403141 |
6 | 1214405142533420005 |
7 | 41403314414206310 |
oct | 3773530222157745 |
9 | 612227401364205 |
10 | 140440100200421 |
11 | 4082634832a74a |
12 | 1390229549a605 |
13 | 60495a1ab5088 |
14 | 26974a10a1977 |
15 | 11382815b0ceb |
hex | 7fbac248dfe5 |
140440100200421 has 16 divisors (see below), whose sum is σ = 162399256745088. Its totient is φ = 118962640742400.
The previous prime is 140440100200409. The next prime is 140440100200537. The reversal of 140440100200421 is 124002001044041.
It is not a de Polignac number, because 140440100200421 - 214 = 140440100184037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140440100200721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 317521100 + ... + 317963093.
It is an arithmetic number, because the mean of its divisors is an integer number (10149953546568).
Almost surely, 2140440100200421 is an apocalyptic number.
It is an amenable number.
140440100200421 is a deficient number, since it is larger than the sum of its proper divisors (21959156544667).
140440100200421 is a wasteful number, since it uses less digits than its factorization.
140440100200421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635484572.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 140440100200421 its reverse (124002001044041), we get a palindrome (264442101244462).
The spelling of 140440100200421 in words is "one hundred forty trillion, four hundred forty billion, one hundred million, two hundred thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •