Base | Representation |
---|---|
bin | 1001111010010100001… |
… | …00001011001011100100 |
3 | 1012120000011112200122002 |
4 | 10331022010023023210 |
5 | 21034414011242430 |
6 | 420235541424432 |
7 | 33414010643504 |
oct | 4751204131344 |
9 | 1176004480562 |
10 | 340545024740 |
11 | 121473874508 |
12 | 55bbba0b118 |
13 | 26161a9bbcb |
14 | 126a7c65a04 |
15 | 8cd1e54845 |
hex | 4f4a10b2e4 |
340545024740 has 24 divisors (see below), whose sum is σ = 715337521080. Its totient is φ = 136181253888.
The previous prime is 340545024731. The next prime is 340545024763. The reversal of 340545024740 is 47420545043.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 76135157476 + 264409867264 = 275926^2 + 514208^2 .
It is a junction number, because it is equal to n+sod(n) for n = 340545024694 and 340545024703.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2221217 + ... + 2369576.
It is an arithmetic number, because the mean of its divisors is an integer number (29805730045).
Almost surely, 2340545024740 is an apocalyptic number.
It is an amenable number.
340545024740 is an abundant number, since it is smaller than the sum of its proper divisors (374792496340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
340545024740 is a wasteful number, since it uses less digits than its factorization.
340545024740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4594511 (or 4594509 counting only the distinct ones).
The product of its (nonzero) digits is 268800, while the sum is 38.
Adding to 340545024740 its reverse (47420545043), we get a palindrome (387965569783).
The spelling of 340545024740 in words is "three hundred forty billion, five hundred forty-five million, twenty-four thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •