Base | Representation |
---|---|
bin | 11111111011011001101000… |
… | …111110101010100010001001 |
3 | 200102012011020100010221102212 |
4 | 133323121220332222202021 |
5 | 121401131033020024113 |
6 | 1214352413303434505 |
7 | 41402053512333641 |
oct | 3773315076524211 |
9 | 612164210127385 |
10 | 140421422033033 |
11 | 40819432a60079 |
12 | 138ba742155a35 |
13 | 60478b621aa1b |
14 | 269660c581521 |
15 | 1137a3b8e90a8 |
hex | 7fb668faa889 |
140421422033033 has 16 divisors (see below), whose sum is σ = 144536433728400. Its totient is φ = 136339785246720.
The previous prime is 140421422033029. The next prime is 140421422033063. The reversal of 140421422033033 is 330330224124041.
It can be written as a sum of positive squares in 8 ways, for example, as 154430329 + 140421267602704 = 12427^2 + 11849948^2 .
It is a cyclic number.
It is not a de Polignac number, because 140421422033033 - 22 = 140421422033029 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140421422033003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18699233 + ... + 25109841.
It is an arithmetic number, because the mean of its divisors is an integer number (9033527108025).
Almost surely, 2140421422033033 is an apocalyptic number.
It is an amenable number.
140421422033033 is a deficient number, since it is larger than the sum of its proper divisors (4115011695367).
140421422033033 is a wasteful number, since it uses less digits than its factorization.
140421422033033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6413212.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 140421422033033 its reverse (330330224124041), we get a palindrome (470751646157074).
The spelling of 140421422033033 in words is "one hundred forty trillion, four hundred twenty-one billion, four hundred twenty-two million, thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •