Base | Representation |
---|---|
bin | 10011011111000111001011… |
… | …01100001100111000011000 |
3 | 12121201110111100102200222010 |
4 | 21233203211230030320120 |
5 | 21104030204003030311 |
6 | 231045120154425520 |
7 | 12011562013332255 |
oct | 1157434554147030 |
9 | 177643440380863 |
10 | 42850447314456 |
11 | 12720855444671 |
12 | 49808541322a0 |
13 | 1abaa1a414712 |
14 | a81d891c042c |
15 | 4e4989c8dda6 |
hex | 26f8e5b0ce18 |
42850447314456 has 32 divisors (see below), whose sum is σ = 110021418782640. Its totient is φ = 13897442371968.
The previous prime is 42850447314397. The next prime is 42850447314533. The reversal of 42850447314456 is 65441374405824.
It is a happy number.
42850447314456 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 42850447314396 and 42850447314405.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 24127503231 + ... + 24127505006.
Almost surely, 242850447314456 is an apocalyptic number.
It is an amenable number.
42850447314456 is an abundant number, since it is smaller than the sum of its proper divisors (67170971468184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42850447314456 is a wasteful number, since it uses less digits than its factorization.
42850447314456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48255008283 (or 48255008279 counting only the distinct ones).
The product of its (nonzero) digits is 51609600, while the sum is 57.
The spelling of 42850447314456 in words is "forty-two trillion, eight hundred fifty billion, four hundred forty-seven million, three hundred fourteen thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •