Base | Representation |
---|---|
bin | 10011010110010000001101… |
… | …11111110000010110000000 |
3 | 12120122100211022102021122001 |
4 | 21223020012333300112000 |
5 | 21034033314213114220 |
6 | 230253220335153344 |
7 | 11650565054000653 |
oct | 1153100677602600 |
9 | 176570738367561 |
10 | 42546063410560 |
11 | 126137586924a6 |
12 | 4931866675854 |
13 | 1a980cc29a348 |
14 | a71351b5389a |
15 | 4dbac27c580a |
hex | 26b206ff0580 |
42546063410560 has 32 divisors (see below), whose sum is σ = 101711682842400. Its totient is φ = 17018425363968.
The previous prime is 42546063410467. The next prime is 42546063410581. The reversal of 42546063410560 is 6501436064524.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 42546063410560.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33239111400 + ... + 33239112679.
It is an arithmetic number, because the mean of its divisors is an integer number (3178490088825).
Almost surely, 242546063410560 is an apocalyptic number.
42546063410560 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42546063410560 is an abundant number, since it is smaller than the sum of its proper divisors (59165619431840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42546063410560 is an equidigital number, since it uses as much as digits as its factorization.
42546063410560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66478224098 (or 66478224086 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 46.
The spelling of 42546063410560 in words is "forty-two trillion, five hundred forty-six billion, sixty-three million, four hundred ten thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •