Base | Representation |
---|---|
bin | 10101000011101010100011… |
… | …10010011110100011010101 |
3 | 20001221202100221221000200020 |
4 | 22201311101302132203111 |
5 | 22032131442114330023 |
6 | 242252225214135353 |
7 | 12516312224625654 |
oct | 1241652162364325 |
9 | 201852327830606 |
10 | 46305414605013 |
11 | 1383301a4016a3 |
12 | 523a3717b1559 |
13 | 1cab77446ac45 |
14 | b612a059519b |
15 | 55479b8b5de3 |
hex | 2a1d51c9e8d5 |
46305414605013 has 16 divisors (see below), whose sum is σ = 62808256880640. Its totient is φ = 30340967788656.
The previous prime is 46305414604921. The next prime is 46305414605017. The reversal of 46305414605013 is 31050641450364.
It is a happy number.
46305414605013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-46305414605013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46305414605017) 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 15 ways as a sum of consecutive naturals, for example, 567886903 + ... + 567968436.
It is an arithmetic number, because the mean of its divisors is an integer number (3925516055040).
Almost surely, 246305414605013 is an apocalyptic number.
It is an amenable number.
46305414605013 is a deficient number, since it is larger than the sum of its proper divisors (16502842275627).
46305414605013 is a wasteful number, since it uses less digits than its factorization.
46305414605013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1135855576.
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 46305414605013 in words is "forty-six trillion, three hundred five billion, four hundred fourteen million, six hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •