Base | Representation |
---|---|
bin | 1000001010110010100… |
… | …0000111111110001001 |
3 | 111102020012100102021111 |
4 | 2002230220013332021 |
5 | 4244401244344113 |
6 | 144245153210321 |
7 | 13065431055565 |
oct | 2025450077611 |
9 | 442205312244 |
10 | 140335153033 |
11 | 54574598619 |
12 | 23245b609a1 |
13 | 1030614a3ba |
14 | 6b13d526a5 |
15 | 39b537613d |
hex | 20aca07f89 |
140335153033 has 2 divisors, whose sum is σ = 140335153034. Its totient is φ = 140335153032.
The previous prime is 140335152959. The next prime is 140335153139. The reversal of 140335153033 is 330351533041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129925644304 + 10409508729 = 360452^2 + 102027^2 .
It is a cyclic number.
It is not a de Polignac number, because 140335153033 - 217 = 140335021961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140335152986 and 140335153004.
It is not a weakly prime, because it can be changed into another prime (140335153333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70167576516 + 70167576517.
It is an arithmetic number, because the mean of its divisors is an integer number (70167576517).
Almost surely, 2140335153033 is an apocalyptic number.
It is an amenable number.
140335153033 is a deficient number, since it is larger than the sum of its proper divisors (1).
140335153033 is an equidigital number, since it uses as much as digits as its factorization.
140335153033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24300, while the sum is 31.
Adding to 140335153033 its reverse (330351533041), we get a palindrome (470686686074).
The spelling of 140335153033 in words is "one hundred forty billion, three hundred thirty-five million, one hundred fifty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •