Base | Representation |
---|---|
bin | 10101000011101101010101… |
… | …11101100011001111000000 |
3 | 20001221220020020001111201221 |
4 | 22201312222331203033000 |
5 | 22032143023113230000 |
6 | 242253033500204424 |
7 | 12516364262225425 |
oct | 1241665275431700 |
9 | 201856206044657 |
10 | 46306910680000 |
11 | 13833717950a03 |
12 | 523a70a839714 |
13 | 1cab9523b7809 |
14 | b613a3155d4c |
15 | 554837dd761a |
hex | 2a1daaf633c0 |
46306910680000 has 70 divisors (see below), whose sum is σ = 114826088839616. Its totient is φ = 18522764256000.
The previous prime is 46306910679949. The next prime is 46306910680003. The reversal of 46306910680000 is 8601960364.
46306910680000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46306910680003) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 578796384 + ... + 578876383.
Almost surely, 246306910680000 is an apocalyptic number.
46306910680000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
46306910680000 is an abundant number, since it is smaller than the sum of its proper divisors (68519178159616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46306910680000 is an equidigital number, since it uses as much as digits as its factorization.
46306910680000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1157672799 (or 1157672774 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 43.
The spelling of 46306910680000 in words is "forty-six trillion, three hundred six billion, nine hundred ten million, six hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •