Base | Representation |
---|---|
bin | 1000001011111011111… |
… | …1110111011000100001 |
3 | 111110000200022021120121 |
4 | 2002332333313120201 |
5 | 4301014200211213 |
6 | 144335523240241 |
7 | 13106162614123 |
oct | 2027677673041 |
9 | 443020267517 |
10 | 140643366433 |
11 | 54712571939 |
12 | 23311219081 |
13 | 10354c627ab |
14 | 6b42c63213 |
15 | 39d245888d |
hex | 20beff7621 |
140643366433 has 2 divisors, whose sum is σ = 140643366434. Its totient is φ = 140643366432.
The previous prime is 140643366427. The next prime is 140643366443. The reversal of 140643366433 is 334663346041.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87611264064 + 53032102369 = 295992^2 + 230287^2 .
It is an emirp because it is prime and its reverse (334663346041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140643366433 - 29 = 140643365921 is a prime.
It is a super-2 number, since 2×1406433664332 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 140643366433.
It is not a weakly prime, because it can be changed into another prime (140643366443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70321683216 + 70321683217.
It is an arithmetic number, because the mean of its divisors is an integer number (70321683217).
Almost surely, 2140643366433 is an apocalyptic number.
It is an amenable number.
140643366433 is a deficient number, since it is larger than the sum of its proper divisors (1).
140643366433 is an equidigital number, since it uses as much as digits as its factorization.
140643366433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1119744, while the sum is 43.
The spelling of 140643366433 in words is "one hundred forty billion, six hundred forty-three million, three hundred sixty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •