Base | Representation |
---|---|
bin | 1100000010000110… |
… | …1000010101010001 |
3 | 22100002220002211220 |
4 | 3000201220111101 |
5 | 23103342311200 |
6 | 1252302555253 |
7 | 143020620252 |
oct | 30041502521 |
9 | 8302802756 |
10 | 3230041425 |
11 | 1408301a26 |
12 | 761898b29 |
13 | 3c6259620 |
14 | 228da8b29 |
15 | 13d8844a0 |
hex | c0868551 |
3230041425 has 24 divisors (see below), whose sum is σ = 5751131904. Its totient is φ = 1590173760.
The previous prime is 3230041403. The next prime is 3230041447. The reversal of 3230041425 is 5241400323.
It is an interprime number because it is at equal distance from previous prime (3230041403) and next prime (3230041447).
It is not a de Polignac number, because 3230041425 - 223 = 3221652817 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3230041395 and 3230041404.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1655457 + ... + 1657406.
It is an arithmetic number, because the mean of its divisors is an integer number (239630496).
Almost surely, 23230041425 is an apocalyptic number.
It is an amenable number.
3230041425 is a deficient number, since it is larger than the sum of its proper divisors (2521090479).
3230041425 is a wasteful number, since it uses less digits than its factorization.
3230041425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3312889 (or 3312884 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 24.
The square root of 3230041425 is about 56833.4533967451. The cubic root of 3230041425 is about 1478.2096418983.
Adding to 3230041425 its reverse (5241400323), we get a palindrome (8471441748).
The spelling of 3230041425 in words is "three billion, two hundred thirty million, forty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •