Base | Representation |
---|---|
bin | 10101000111101100110101… |
… | …01101101101001011110000 |
3 | 20002110000021120202210021211 |
4 | 22203312122231231023300 |
5 | 22041414432210410324 |
6 | 242440040415325504 |
7 | 12532321345126561 |
oct | 1243663255551360 |
9 | 202400246683254 |
10 | 46444077044464 |
11 | 138869057737a0 |
12 | 526120b520894 |
13 | 1cbb871ba3898 |
14 | b67c962c6168 |
15 | 5581b4e78294 |
hex | 2a3d9ab6d2f0 |
46444077044464 has 20 divisors (see below), whose sum is σ = 98165890117080. Its totient is φ = 21110944111040.
The previous prime is 46444077044461. The next prime is 46444077044549.
46444077044464 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 46444077044399 and 46444077044408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46444077044461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 131943400519 + ... + 131943400870.
It is an arithmetic number, because the mean of its divisors is an integer number (4908294505854).
Almost surely, 246444077044464 is an apocalyptic number.
46444077044464 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
46444077044464 is an abundant number, since it is smaller than the sum of its proper divisors (51721813072616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46444077044464 is a wasteful number, since it uses less digits than its factorization.
46444077044464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263886801408 (or 263886801402 counting only the distinct ones).
The product of its (nonzero) digits is 115605504, while the sum is 58.
The spelling of 46444077044464 in words is "forty-six trillion, four hundred forty-four billion, seventy-seven million, forty-four thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •