Base | Representation |
---|---|
bin | 1000101001001100… |
… | …01110001011000111 |
3 | 102222101222101222211 |
4 | 10110212032023013 |
5 | 34000433444033 |
6 | 2044250404251 |
7 | 222665602213 |
oct | 42446161307 |
9 | 12871871884 |
10 | 4640531143 |
11 | 1a71505806 |
12 | a96130687 |
13 | 58c53b821 |
14 | 32044b943 |
15 | 1c25ec2cd |
hex | 11498e2c7 |
4640531143 has 4 divisors (see below), whose sum is σ = 4790225728. Its totient is φ = 4490836560.
The previous prime is 4640531107. The next prime is 4640531173. The reversal of 4640531143 is 3411350464.
It is a happy number.
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 4640531143 - 217 = 4640400071 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 149694553 = 4640531143 / (4 + 6 + 4 + 0 + 5 + 3 + 1 + 1 + 4 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4640531173) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74847246 + ... + 74847307.
It is an arithmetic number, because the mean of its divisors is an integer number (1197556432).
Almost surely, 24640531143 is an apocalyptic number.
4640531143 is a deficient number, since it is larger than the sum of its proper divisors (149694585).
4640531143 is a wasteful number, since it uses less digits than its factorization.
4640531143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149694584.
The product of its (nonzero) digits is 17280, while the sum is 31.
The square root of 4640531143 is about 68121.4440760030. Note that the first 3 decimals coincide. The cubic root of 4640531143 is about 1667.9738228088.
The spelling of 4640531143 in words is "four billion, six hundred forty million, five hundred thirty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •