Base | Representation |
---|---|
bin | 10101000001110110101011… |
… | …11011111100011111111001 |
3 | 20001201210210121122220102012 |
4 | 22200323111323330133321 |
5 | 22030122042013420131 |
6 | 242203500333015305 |
7 | 12511650532304540 |
oct | 1240732573743771 |
9 | 201653717586365 |
10 | 46243207170041 |
11 | 138096a7987012 |
12 | 522a2b0624535 |
13 | 1ca593c5a821b |
14 | b5c27c88b157 |
15 | 552d5a47852b |
hex | 2a0ed5efc7f9 |
46243207170041 has 4 divisors (see below), whose sum is σ = 52849379622912. Its totient is φ = 39637034717172.
The previous prime is 46243207169903. The next prime is 46243207170077. The reversal of 46243207170041 is 14007170234264.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 46243207170041 - 214 = 46243207153657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (46243207170341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3303086226425 + ... + 3303086226438.
It is an arithmetic number, because the mean of its divisors is an integer number (13212344905728).
Almost surely, 246243207170041 is an apocalyptic number.
It is an amenable number.
46243207170041 is a deficient number, since it is larger than the sum of its proper divisors (6606172452871).
46243207170041 is an equidigital number, since it uses as much as digits as its factorization.
46243207170041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6606172452870.
The product of its (nonzero) digits is 225792, while the sum is 41.
The spelling of 46243207170041 in words is "forty-six trillion, two hundred forty-three billion, two hundred seven million, one hundred seventy thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •