Base | Representation |
---|---|
bin | 1001000010001110… |
… | …0100011001100011 |
3 | 20021000112010021112 |
4 | 2100203210121203 |
5 | 14431330240420 |
6 | 1040353213535 |
7 | 114046140662 |
oct | 22043443143 |
9 | 6230463245 |
10 | 2425243235 |
11 | 1034a94158 |
12 | 5782612ab |
13 | 2c85b678c |
14 | 190150dd9 |
15 | e2db08c5 |
hex | 908e4663 |
2425243235 has 4 divisors (see below), whose sum is σ = 2910291888. Its totient is φ = 1940194584.
The previous prime is 2425243189. The next prime is 2425243237. The reversal of 2425243235 is 5323425242.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5323425242 = 2 ⋅2661712621.
It is a cyclic number.
It is not a de Polignac number, because 2425243235 - 224 = 2408466019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2425243237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 242524319 + ... + 242524328.
It is an arithmetic number, because the mean of its divisors is an integer number (727572972).
Almost surely, 22425243235 is an apocalyptic number.
2425243235 is a deficient number, since it is larger than the sum of its proper divisors (485048653).
2425243235 is an equidigital number, since it uses as much as digits as its factorization.
2425243235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485048652.
The product of its digits is 57600, while the sum is 32.
The square root of 2425243235 is about 49246.7586242993. The cubic root of 2425243235 is about 1343.5436085825.
Adding to 2425243235 its reverse (5323425242), we get a palindrome (7748668477).
The spelling of 2425243235 in words is "two billion, four hundred twenty-five million, two hundred forty-three thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •