Base | Representation |
---|---|
bin | 101011000111000000… |
… | …000001001000000101 |
3 | 11102110220200111011201 |
4 | 223013000001020011 |
5 | 1224244303443212 |
6 | 33133051502501 |
7 | 3226032266641 |
oct | 530700011005 |
9 | 142426614151 |
10 | 46288343557 |
11 | 186a3621695 |
12 | 8b79a57a31 |
13 | 4498ac7601 |
14 | 23517d7c21 |
15 | 130dac9b57 |
hex | ac7001205 |
46288343557 has 2 divisors, whose sum is σ = 46288343558. Its totient is φ = 46288343556.
The previous prime is 46288343537. The next prime is 46288343587. The reversal of 46288343557 is 75534388264.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45114184801 + 1174158756 = 212401^2 + 34266^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-46288343557 is a prime.
It is a super-2 number, since 2×462883435572 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 46288343498 and 46288343507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46288343537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23144171778 + 23144171779.
It is an arithmetic number, because the mean of its divisors is an integer number (23144171779).
Almost surely, 246288343557 is an apocalyptic number.
It is an amenable number.
46288343557 is a deficient number, since it is larger than the sum of its proper divisors (1).
46288343557 is an equidigital number, since it uses as much as digits as its factorization.
46288343557 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19353600, while the sum is 55.
The spelling of 46288343557 in words is "forty-six billion, two hundred eighty-eight million, three hundred forty-three thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •