Base | Representation |
---|---|
bin | 1000110011001000… |
… | …1100111101101110 |
3 | 20002121110112110110 |
4 | 2030302030331232 |
5 | 14314131024132 |
6 | 1030213120450 |
7 | 112350263331 |
oct | 21462147556 |
9 | 6077415413 |
10 | 2361970542 |
11 | 10022a8478 |
12 | 55b029126 |
13 | 2b8462009 |
14 | 1859a0618 |
15 | dc5631cc |
hex | 8cc8cf6e |
2361970542 has 8 divisors (see below), whose sum is σ = 4723941096. Its totient is φ = 787323512.
The previous prime is 2361970489. The next prime is 2361970549. The reversal of 2361970542 is 2450791632.
It is a sphenic number, since it is the product of 3 distinct primes.
2361970542 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 2361970542.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2361970549) 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 3 ways as a sum of consecutive naturals, for example, 196830873 + ... + 196830884.
It is an arithmetic number, because the mean of its divisors is an integer number (590492637).
Almost surely, 22361970542 is an apocalyptic number.
2361970542 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.
2361970542 is a wasteful number, since it uses less digits than its factorization.
2361970542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393661762.
The product of its (nonzero) digits is 90720, while the sum is 39.
The square root of 2361970542 is about 48600.1084566691. The cubic root of 2361970542 is about 1331.7565014499.
The spelling of 2361970542 in words is "two billion, three hundred sixty-one million, nine hundred seventy thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •