Base | Representation |
---|---|
bin | 1100000010001100… |
… | …0101000110110001 |
3 | 22100010121102002222 |
4 | 3000203011012301 |
5 | 23103441441200 |
6 | 1252315050425 |
7 | 143024062160 |
oct | 30043050661 |
9 | 8303542088 |
10 | 3230421425 |
11 | 1408541480 |
12 | 761a40a15 |
13 | 3c636058a |
14 | 2290673d7 |
15 | 13d90bd85 |
hex | c08c51b1 |
3230421425 has 48 divisors (see below), whose sum is σ = 5005286784. Its totient is φ = 2009280000.
The previous prime is 3230421421. The next prime is 3230421443. The reversal of 3230421425 is 5241240323.
It is not a de Polignac number, because 3230421425 - 22 = 3230421421 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3230421394 and 3230421403.
It is not an unprimeable number, because it can be changed into a prime (3230421421) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1001315 + ... + 1004535.
It is an arithmetic number, because the mean of its divisors is an integer number (104276808).
Almost surely, 23230421425 is an apocalyptic number.
3230421425 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3230421425 is a deficient number, since it is larger than the sum of its proper divisors (1774865359).
3230421425 is a wasteful number, since it uses less digits than its factorization.
3230421425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3770 (or 3765 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 26.
The square root of 3230421425 is about 56836.7963998676. The cubic root of 3230421425 is about 1478.2676078873.
Adding to 3230421425 its reverse (5241240323), we get a palindrome (8471661748).
The spelling of 3230421425 in words is "three billion, two hundred thirty million, four hundred twenty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •