Base | Representation |
---|---|
bin | 1001000001100011… |
… | …0110010101110101 |
3 | 20020211020100112222 |
4 | 2100120312111311 |
5 | 14430120330031 |
6 | 1040213052125 |
7 | 114013225202 |
oct | 22030662565 |
9 | 6224210488 |
10 | 2422433141 |
11 | 1033444967 |
12 | 577327045 |
13 | 2c7b416bb |
14 | 18da1cca9 |
15 | e2a07e7b |
hex | 90636575 |
2422433141 has 8 divisors (see below), whose sum is σ = 2429803584. Its totient is φ = 2415072960.
The previous prime is 2422433129. The next prime is 2422433147. The reversal of 2422433141 is 1413342242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2422433141 - 26 = 2422433077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2422433141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2422433147) 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, 853661 + ... + 856493.
It is an arithmetic number, because the mean of its divisors is an integer number (303725448).
Almost surely, 22422433141 is an apocalyptic number.
It is an amenable number.
2422433141 is a deficient number, since it is larger than the sum of its proper divisors (7370443).
2422433141 is a wasteful number, since it uses less digits than its factorization.
2422433141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5131.
The product of its digits is 4608, while the sum is 26.
The square root of 2422433141 is about 49218.2196041263. The cubic root of 2422433141 is about 1343.0244932325.
Adding to 2422433141 its reverse (1413342242), we get a palindrome (3835775383).
The spelling of 2422433141 in words is "two billion, four hundred twenty-two million, four hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •