Base | Representation |
---|---|
bin | 10000110001101… |
… | …00110111100101 |
3 | 100210210121102012 |
4 | 20120310313211 |
5 | 242011210413 |
6 | 21544124005 |
7 | 3326102051 |
oct | 1030646745 |
9 | 323717365 |
10 | 140725733 |
11 | 72488365 |
12 | 3b166605 |
13 | 23202785 |
14 | 14992c61 |
15 | c54b7a8 |
hex | 8634de5 |
140725733 has 2 divisors, whose sum is σ = 140725734. Its totient is φ = 140725732.
The previous prime is 140725729. The next prime is 140725751. The reversal of 140725733 is 337527041.
140725733 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 140612164 + 113569 = 11858^2 + 337^2 .
It is an emirp because it is prime and its reverse (337527041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140725733 - 22 = 140725729 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140725733.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140725703) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70362866 + 70362867.
It is an arithmetic number, because the mean of its divisors is an integer number (70362867).
Almost surely, 2140725733 is an apocalyptic number.
It is an amenable number.
140725733 is a deficient number, since it is larger than the sum of its proper divisors (1).
140725733 is an equidigital number, since it uses as much as digits as its factorization.
140725733 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17640, while the sum is 32.
The square root of 140725733 is about 11862.7877415049. The cubic root of 140725733 is about 520.1450938800.
The spelling of 140725733 in words is "one hundred forty million, seven hundred twenty-five thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •