Base | Representation |
---|---|
bin | 101011010011111110… |
… | …010100000110001101 |
3 | 11110001002020121202101 |
4 | 223103332110012031 |
5 | 1230221014011111 |
6 | 33210424555101 |
7 | 3234314325052 |
oct | 532376240615 |
9 | 143032217671 |
10 | 46506000781 |
11 | 187a5474799 |
12 | 901a922a91 |
13 | 4501c24876 |
14 | 2372695029 |
15 | 1322c70bc1 |
hex | ad3f9418d |
46506000781 has 2 divisors, whose sum is σ = 46506000782. Its totient is φ = 46506000780.
The previous prime is 46506000733. The next prime is 46506000787. The reversal of 46506000781 is 18700060564.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 44408818756 + 2097182025 = 210734^2 + 45795^2 .
It is a cyclic number.
It is not a de Polignac number, because 46506000781 - 221 = 46503903629 is a prime.
It is a super-2 number, since 2×465060007812 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 46506000781.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46506000787) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23253000390 + 23253000391.
It is an arithmetic number, because the mean of its divisors is an integer number (23253000391).
Almost surely, 246506000781 is an apocalyptic number.
It is an amenable number.
46506000781 is a deficient number, since it is larger than the sum of its proper divisors (1).
46506000781 is an equidigital number, since it uses as much as digits as its factorization.
46506000781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 37.
The spelling of 46506000781 in words is "forty-six billion, five hundred six million, seven hundred eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •