Base | Representation |
---|---|
bin | 10010101110001001110… |
… | …01011011011101101101 |
3 | 2021111100102222100002112 |
4 | 21113010321123131231 |
5 | 41014340400004031 |
6 | 1211301231133405 |
7 | 64321264446425 |
oct | 11270471333555 |
9 | 2244312870075 |
10 | 643253516141 |
11 | 228890927455 |
12 | a4800374265 |
13 | 48873a98242 |
14 | 231c29ab485 |
15 | 11aec2c462b |
hex | 95c4e5b76d |
643253516141 has 16 divisors (see below), whose sum is σ = 669763479600. Its totient is φ = 617037324288.
The previous prime is 643253516119. The next prime is 643253516153. The reversal of 643253516141 is 141615352346.
It can be written as a sum of positive squares in 8 ways, for example, as 92875000516 + 550378515625 = 304754^2 + 741875^2 .
It is a cyclic number.
It is not a de Polignac number, because 643253516141 - 26 = 643253516077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (643253566141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7023455 + ... + 7114451.
It is an arithmetic number, because the mean of its divisors is an integer number (41860217475).
Almost surely, 2643253516141 is an apocalyptic number.
It is an amenable number.
643253516141 is a deficient number, since it is larger than the sum of its proper divisors (26509963459).
643253516141 is a wasteful number, since it uses less digits than its factorization.
643253516141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92608.
The product of its digits is 259200, while the sum is 41.
Adding to 643253516141 its reverse (141615352346), we get a palindrome (784868868487).
The spelling of 643253516141 in words is "six hundred forty-three billion, two hundred fifty-three million, five hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •