Base | Representation |
---|---|
bin | 100001100011111000100… |
… | …0111101110011001110110 |
3 | 121022221210012122010012110 |
4 | 1003013301013232121312 |
5 | 1101032443040231432 |
6 | 13450550220231450 |
7 | 654150112443633 |
oct | 103076107563166 |
9 | 17287705563173 |
10 | 4612545242742 |
11 | 15191955a4778 |
12 | 625b3809b586 |
13 | 275c658537a8 |
14 | 11d3697b318a |
15 | 7eeb239bdcc |
hex | 431f11ee676 |
4612545242742 has 8 divisors (see below), whose sum is σ = 9225090485496. Its totient is φ = 1537515080912.
The previous prime is 4612545242741. The next prime is 4612545242771. The reversal of 4612545242742 is 2472425452164.
It is a sphenic number, since it is the product of 3 distinct primes.
4612545242742 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 4612545242691 and 4612545242700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4612545242741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 384378770223 + ... + 384378770234.
It is an arithmetic number, because the mean of its divisors is an integer number (1153136310687).
Almost surely, 24612545242742 is an apocalyptic number.
4612545242742 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.
4612545242742 is a wasteful number, since it uses less digits than its factorization.
4612545242742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 768757540462.
The product of its digits is 4300800, while the sum is 48.
The spelling of 4612545242742 in words is "four trillion, six hundred twelve billion, five hundred forty-five million, two hundred forty-two thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •