Base | Representation |
---|---|
bin | 10010101110100000000… |
… | …10010101101101001111 |
3 | 2021111211110122002020112 |
4 | 21113100002111231033 |
5 | 41020231220314411 |
6 | 1211331544510235 |
7 | 64326024112055 |
oct | 11272002255517 |
9 | 2244743562215 |
10 | 643440401231 |
11 | 228977371a41 |
12 | a4852a7b37b |
13 | 488a370cc34 |
14 | 231dd7381d5 |
15 | 11b0d8dcb8b |
hex | 95d0095b4f |
643440401231 has 4 divisors (see below), whose sum is σ = 643470675000. Its totient is φ = 643410127464.
The previous prime is 643440401089. The next prime is 643440401251. The reversal of 643440401231 is 132104044346.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 643440401231 - 234 = 626260532047 is a prime.
It is a super-2 number, since 2×6434404012312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (643440401251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15104981 + ... + 15147518.
It is an arithmetic number, because the mean of its divisors is an integer number (160867668750).
Almost surely, 2643440401231 is an apocalyptic number.
643440401231 is a deficient number, since it is larger than the sum of its proper divisors (30273769).
643440401231 is a wasteful number, since it uses less digits than its factorization.
643440401231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30273768.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 643440401231 its reverse (132104044346), we get a palindrome (775544445577).
The spelling of 643440401231 in words is "six hundred forty-three billion, four hundred forty million, four hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •