Base | Representation |
---|---|
bin | 1001000110010100… |
… | …0110011101111101 |
3 | 20022012211220022022 |
4 | 2101211012131331 |
5 | 20000230002031 |
6 | 1042205325525 |
7 | 114345150155 |
oct | 22145063575 |
9 | 6265756268 |
10 | 2442422141 |
11 | 10437579a5 |
12 | 581b668a5 |
13 | 2cc01cb03 |
14 | 192543765 |
15 | e465597b |
hex | 9194677d |
2442422141 has 16 divisors (see below), whose sum is σ = 2644608000. Its totient is φ = 2249026560.
The previous prime is 2442422123. The next prime is 2442422167. The reversal of 2442422141 is 1412242442.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2442422141 - 226 = 2375313277 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2442422141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2442422041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 128735 + ... + 146483.
It is an arithmetic number, because the mean of its divisors is an integer number (165288000).
Almost surely, 22442422141 is an apocalyptic number.
It is an amenable number.
2442422141 is a deficient number, since it is larger than the sum of its proper divisors (202185859).
2442422141 is a wasteful number, since it uses less digits than its factorization.
2442422141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17996.
The product of its digits is 4096, while the sum is 26.
The square root of 2442422141 is about 49420.8674650699. The cubic root of 2442422141 is about 1346.7084219468.
Adding to 2442422141 its reverse (1412242442), we get a palindrome (3854664583).
The spelling of 2442422141 in words is "two billion, four hundred forty-two million, four hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •