Base | Representation |
---|---|
bin | 10101001001100101001101… |
… | …00101101100100000010100 |
3 | 20002200012002022201201120020 |
4 | 22210302212211230200110 |
5 | 22043444304344434224 |
6 | 242525445134305140 |
7 | 12540066650616501 |
oct | 1244624645544024 |
9 | 202605068651506 |
10 | 46508700780564 |
11 | 13901258125160 |
12 | 52718459581b0 |
13 | 1cc49a053bb99 |
14 | b6b066c944a8 |
15 | 559be85abc79 |
hex | 2a4ca696c814 |
46508700780564 has 48 divisors (see below), whose sum is σ = 118389255155136. Its totient is φ = 14093132435200.
The previous prime is 46508700780559. The next prime is 46508700780611.
46508700780564 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 46508700780498 and 46508700780507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 631947 + ... + 9665234.
It is an arithmetic number, because the mean of its divisors is an integer number (2466442815732).
Almost surely, 246508700780564 is an apocalyptic number.
46508700780564 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
46508700780564 is an abundant number, since it is smaller than the sum of its proper divisors (71880554374572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46508700780564 is a wasteful number, since it uses less digits than its factorization.
46508700780564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10331416 (or 10331414 counting only the distinct ones).
The product of its (nonzero) digits is 45158400, while the sum is 60.
The spelling of 46508700780564 in words is "forty-six trillion, five hundred eight billion, seven hundred million, seven hundred eighty thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •