Base | Representation |
---|---|
bin | 11111111011011001010110… |
… | …100011110100000000000010 |
3 | 200102012010102210122122100101 |
4 | 133323121112203310000002 |
5 | 121401124414412112114 |
6 | 1214352322504113014 |
7 | 41402043040540522 |
oct | 3773312643640002 |
9 | 612163383578311 |
10 | 140421113004034 |
11 | 4081929457a005 |
12 | 138ba67676576a |
13 | 60478671ab325 |
14 | 26965bd4db682 |
15 | 1137a1e704d74 |
hex | 7fb6568f4002 |
140421113004034 has 4 divisors (see below), whose sum is σ = 210631669506054. Its totient is φ = 70210556502016.
The previous prime is 140421113004019. The next prime is 140421113004037. The reversal of 140421113004034 is 430400311124041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 110675596941009 + 29745516063025 = 10520247^2 + 5453945^2 .
It is a junction number, because it is equal to n+sod(n) for n = 140421113003993 and 140421113004011.
It is not an unprimeable number, because it can be changed into a prime (140421113004037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35105278251007 + ... + 35105278251010.
Almost surely, 2140421113004034 is an apocalyptic number.
140421113004034 is a deficient number, since it is larger than the sum of its proper divisors (70210556502020).
140421113004034 is an equidigital number, since it uses as much as digits as its factorization.
140421113004034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70210556502019.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 140421113004034 its reverse (430400311124041), we get a palindrome (570821424128075).
The spelling of 140421113004034 in words is "one hundred forty trillion, four hundred twenty-one billion, one hundred thirteen million, four thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •