Base | Representation |
---|---|
bin | 1000001010101010111… |
… | …1011000001100000001 |
3 | 111102010222210021112011 |
4 | 2002222233120030001 |
5 | 4244320144000113 |
6 | 144242102532521 |
7 | 13064565034024 |
oct | 2025257301401 |
9 | 442128707464 |
10 | 140303500033 |
11 | 54558739214 |
12 | 23237437141 |
13 | 102cc716c08 |
14 | 6b0da731bb |
15 | 39b26c263d |
hex | 20aabd8301 |
140303500033 has 2 divisors, whose sum is σ = 140303500034. Its totient is φ = 140303500032.
The previous prime is 140303500031. The next prime is 140303500039. The reversal of 140303500033 is 330005303041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 139852065024 + 451435009 = 373968^2 + 21247^2 .
It is an emirp because it is prime and its reverse (330005303041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140303500033 - 21 = 140303500031 is a prime.
Together with 140303500031, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 140303499977 and 140303500013.
It is not a weakly prime, because it can be changed into another prime (140303500031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70151750016 + 70151750017.
It is an arithmetic number, because the mean of its divisors is an integer number (70151750017).
Almost surely, 2140303500033 is an apocalyptic number.
It is an amenable number.
140303500033 is a deficient number, since it is larger than the sum of its proper divisors (1).
140303500033 is an equidigital number, since it uses as much as digits as its factorization.
140303500033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 22.
Adding to 140303500033 its reverse (330005303041), we get a palindrome (470308803074).
The spelling of 140303500033 in words is "one hundred forty billion, three hundred three million, five hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •