Base | Representation |
---|---|
bin | 10101000100001010101001… |
… | …10111100001111101100011 |
3 | 20002000101211212002012220001 |
4 | 22202011110313201331203 |
5 | 22032422234402134111 |
6 | 242304155125400431 |
7 | 12520462232315461 |
oct | 1242052467417543 |
9 | 202011755065801 |
10 | 46322646130531 |
11 | 1383a362125881 |
12 | 5241780569117 |
13 | 1cb028c405aa4 |
14 | b62056d01831 |
15 | 554e595731c1 |
hex | 2a2154de1f63 |
46322646130531 has 2 divisors, whose sum is σ = 46322646130532. Its totient is φ = 46322646130530.
The previous prime is 46322646130469. The next prime is 46322646130583. The reversal of 46322646130531 is 13503164622364.
46322646130531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 46322646130531 - 225 = 46322612576099 is a prime.
It is a super-2 number, since 2×463226461305312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (46322646130231) 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, 23161323065265 + 23161323065266.
It is an arithmetic number, because the mean of its divisors is an integer number (23161323065266).
Almost surely, 246322646130531 is an apocalyptic number.
46322646130531 is a deficient number, since it is larger than the sum of its proper divisors (1).
46322646130531 is an equidigital number, since it uses as much as digits as its factorization.
46322646130531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1866240, while the sum is 46.
The spelling of 46322646130531 in words is "forty-six trillion, three hundred twenty-two billion, six hundred forty-six million, one hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •