Base | Representation |
---|---|
bin | 1100000101001101… |
… | …1100100100001111 |
3 | 22101000110120102210 |
4 | 3001103130210033 |
5 | 23120213203211 |
6 | 1253450521503 |
7 | 143236620204 |
oct | 30123344417 |
9 | 8330416383 |
10 | 3243100431 |
11 | 141471139a |
12 | 766136293 |
13 | 3c8b7c64c |
14 | 22aa07cab |
15 | 13eab39a6 |
hex | c14dc90f |
3243100431 has 8 divisors (see below), whose sum is σ = 4441002544. Its totient is φ = 2103632640.
The previous prime is 3243100429. The next prime is 3243100447. The reversal of 3243100431 is 1340013423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3243100431 - 21 = 3243100429 is a prime.
It is a super-2 number, since 2×32431004312 = 21035400811104771522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3243100398 and 3243100407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3243100411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14608450 + ... + 14608671.
It is an arithmetic number, because the mean of its divisors is an integer number (555125318).
Almost surely, 23243100431 is an apocalyptic number.
3243100431 is a deficient number, since it is larger than the sum of its proper divisors (1197902113).
3243100431 is a wasteful number, since it uses less digits than its factorization.
3243100431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29217161.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 3243100431 is about 56948.2258810580. The cubic root of 3243100431 is about 1480.1990892084.
Adding to 3243100431 its reverse (1340013423), we get a palindrome (4583113854).
The spelling of 3243100431 in words is "three billion, two hundred forty-three million, one hundred thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •