Base | Representation |
---|---|
bin | 1001000001100101… |
… | …0000110100101101 |
3 | 20020211102212100110 |
4 | 2100121100310231 |
5 | 14430132312423 |
6 | 1040215250233 |
7 | 114014156352 |
oct | 22031206455 |
9 | 6224385313 |
10 | 2422541613 |
11 | 1033509408 |
12 | 577379979 |
13 | 2c7b7bb9b |
14 | 18da4a629 |
15 | e2a2a193 |
hex | 90650d2d |
2422541613 has 4 divisors (see below), whose sum is σ = 3230055488. Its totient is φ = 1615027740.
The previous prime is 2422541609. The next prime is 2422541647. The reversal of 2422541613 is 3161452242.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2422541613 - 22 = 2422541609 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2422541683) 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, 403756933 + ... + 403756938.
It is an arithmetic number, because the mean of its divisors is an integer number (807513872).
Almost surely, 22422541613 is an apocalyptic number.
It is an amenable number.
2422541613 is a deficient number, since it is larger than the sum of its proper divisors (807513875).
2422541613 is an equidigital number, since it uses as much as digits as its factorization.
2422541613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 807513874.
The product of its digits is 11520, while the sum is 30.
The square root of 2422541613 is about 49219.3215414435. The cubic root of 2422541613 is about 1343.0445389703.
Adding to 2422541613 its reverse (3161452242), we get a palindrome (5583993855).
The spelling of 2422541613 in words is "two billion, four hundred twenty-two million, five hundred forty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •