Base | Representation |
---|---|
bin | 1001110111110110… |
… | …0010111100101010 |
3 | 20211200201220202010 |
4 | 2131331202330222 |
5 | 20411420004332 |
6 | 1114550020350 |
7 | 122446650534 |
oct | 23575427452 |
9 | 6750656663 |
10 | 2650156842 |
11 | 113aa43073 |
12 | 61b6476b6 |
13 | 333084858 |
14 | 1b1d7a854 |
15 | 1079db9cc |
hex | 9df62f2a |
2650156842 has 8 divisors (see below), whose sum is σ = 5300313696. Its totient is φ = 883385612.
The previous prime is 2650156837. The next prime is 2650156849. The reversal of 2650156842 is 2486510562.
It is a sphenic number, since it is the product of 3 distinct primes.
2650156842 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 2650156842.
It is not an unprimeable number, because it can be changed into a prime (2650156849) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220846398 + ... + 220846409.
It is an arithmetic number, because the mean of its divisors is an integer number (662539212).
Almost surely, 22650156842 is an apocalyptic number.
2650156842 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2650156842 is a wasteful number, since it uses less digits than its factorization.
2650156842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441692812.
The product of its (nonzero) digits is 115200, while the sum is 39.
The square root of 2650156842 is about 51479.6740665673. The cubic root of 2650156842 is about 1383.8548040208.
The spelling of 2650156842 in words is "two billion, six hundred fifty million, one hundred fifty-six thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •