Base | Representation |
---|---|
bin | 10000101100011… |
… | …10010100011111 |
3 | 100202111221122012 |
4 | 20112032110133 |
5 | 241322343201 |
6 | 21521341435 |
7 | 3320231144 |
oct | 1026162437 |
9 | 322457565 |
10 | 140043551 |
11 | 7206187a |
12 | 3aa9787b |
13 | 2302410b |
14 | 148563cb |
15 | c4645bb |
hex | 858e51f |
140043551 has 2 divisors, whose sum is σ = 140043552. Its totient is φ = 140043550.
The previous prime is 140043539. The next prime is 140043571. The reversal of 140043551 is 155340041.
140043551 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 is an emirp because it is prime and its reverse (155340041) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140043551 is a prime.
It is a super-2 number, since 2×1400435512 = 39224392353379202, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140043571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70021775 + 70021776.
It is an arithmetic number, because the mean of its divisors is an integer number (70021776).
Almost surely, 2140043551 is an apocalyptic number.
140043551 is a deficient number, since it is larger than the sum of its proper divisors (1).
140043551 is an equidigital number, since it uses as much as digits as its factorization.
140043551 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 140043551 is about 11833.9997887443. Note that the first 3 decimals coincide. The cubic root of 140043551 is about 519.3032470579.
Adding to 140043551 its reverse (155340041), we get a palindrome (295383592).
The spelling of 140043551 in words is "one hundred forty million, forty-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •