Base | Representation |
---|---|
bin | 10101000111100000110010… |
… | …10000011100100001010000 |
3 | 20002102101120220011022011011 |
4 | 22203300121100130201100 |
5 | 22041313211144131442 |
6 | 242433051003300304 |
7 | 12532002161321041 |
oct | 1243603120344120 |
9 | 202371526138134 |
10 | 46437610145872 |
11 | 13884097335100 |
12 | 525bb0581a694 |
13 | 1cbb08117257a |
14 | b6784149a8c8 |
15 | 557e37365117 |
hex | 2a3c1941c850 |
46437610145872 has 60 divisors (see below), whose sum is σ = 98897076346068. Its totient is φ = 21107731955200.
The previous prime is 46437610145869. The next prime is 46437610145873. The reversal of 46437610145872 is 27854101673464.
It can be written as a sum of positive squares in 2 ways, for example, as 1973305705536 + 44464304440336 = 1404744^2 + 6668156^2 .
It is a super-2 number, since 2×464376101458722 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46437610145873) 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 11 ways as a sum of consecutive naturals, for example, 292723278 + ... + 292881874.
Almost surely, 246437610145872 is an apocalyptic number.
It is an amenable number.
46437610145872 is an abundant number, since it is smaller than the sum of its proper divisors (52459466200196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46437610145872 is a wasteful number, since it uses less digits than its factorization.
46437610145872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309868 (or 309851 counting only the distinct ones).
The product of its (nonzero) digits is 27095040, while the sum is 58.
The spelling of 46437610145872 in words is "forty-six trillion, four hundred thirty-seven billion, six hundred ten million, one hundred forty-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •