Base | Representation |
---|---|
bin | 1011101100101111… |
… | …0011000011100111 |
3 | 22002212021110222010 |
4 | 2323023303003213 |
5 | 22412422311403 |
6 | 1235342205303 |
7 | 140552142504 |
oct | 27313630347 |
9 | 8085243863 |
10 | 3140432103 |
11 | 1371768136 |
12 | 737883833 |
13 | 3b0813463 |
14 | 21b1204ab |
15 | 135a83603 |
hex | bb2f30e7 |
3140432103 has 8 divisors (see below), whose sum is σ = 4193881216. Its totient is φ = 2090302200.
The previous prime is 3140432089. The next prime is 3140432111. The reversal of 3140432103 is 3012340413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3140432103 - 212 = 3140428007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3140432103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3140432003) 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 7 ways as a sum of consecutive naturals, for example, 827593 + ... + 831378.
It is an arithmetic number, because the mean of its divisors is an integer number (524235152).
Almost surely, 23140432103 is an apocalyptic number.
3140432103 is a deficient number, since it is larger than the sum of its proper divisors (1053449113).
3140432103 is a wasteful number, since it uses less digits than its factorization.
3140432103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1659605.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 3140432103 is about 56039.5583762042. The cubic root of 3140432103 is about 1464.4115180790.
Adding to 3140432103 its reverse (3012340413), we get a palindrome (6152772516).
The spelling of 3140432103 in words is "three billion, one hundred forty million, four hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •