Base | Representation |
---|---|
bin | 10101010010101001010010… |
… | …11101010001010111010011 |
3 | 20010202221221122100010221202 |
4 | 22221110221131101113103 |
5 | 22114100113303022401 |
6 | 243324512253541415 |
7 | 12601433365602164 |
oct | 1251245135212723 |
9 | 203687848303852 |
10 | 46820134032851 |
11 | 13a11342077093 |
12 | 53020801a486b |
13 | 2018172c79b1a |
14 | b7c16c64576b |
15 | 562d7488b06b |
hex | 2a95297515d3 |
46820134032851 has 2 divisors, whose sum is σ = 46820134032852. Its totient is φ = 46820134032850.
The previous prime is 46820134032839. The next prime is 46820134032869. The reversal of 46820134032851 is 15823043102864.
46820134032851 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-46820134032851 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 46820134032796 and 46820134032805.
It is not a weakly prime, because it can be changed into another prime (46820134032751) 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 as a sum of consecutive naturals, namely, 23410067016425 + 23410067016426.
It is an arithmetic number, because the mean of its divisors is an integer number (23410067016426).
Almost surely, 246820134032851 is an apocalyptic number.
46820134032851 is a deficient number, since it is larger than the sum of its proper divisors (1).
46820134032851 is an equidigital number, since it uses as much as digits as its factorization.
46820134032851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1105920, while the sum is 47.
The spelling of 46820134032851 in words is "forty-six trillion, eight hundred twenty billion, one hundred thirty-four million, thirty-two thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •