Base | Representation |
---|---|
bin | 101010111111011011… |
… | …110100111000011101 |
3 | 11102011001211212220022 |
4 | 222333123310320131 |
5 | 1224014310300314 |
6 | 33112315201525 |
7 | 3222631362623 |
oct | 527733647035 |
9 | 142131755808 |
10 | 46161415709 |
11 | 18638a08942 |
12 | 8b434462a5 |
13 | 4478716286 |
14 | 233c9d7513 |
15 | 13028a678e |
hex | abf6f4e1d |
46161415709 has 2 divisors, whose sum is σ = 46161415710. Its totient is φ = 46161415708.
The previous prime is 46161415697. The next prime is 46161415787. The reversal of 46161415709 is 90751416164.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46148491684 + 12924025 = 214822^2 + 3595^2 .
It is a cyclic number.
It is not a de Polignac number, because 46161415709 - 216 = 46161350173 is a prime.
It is a super-2 number, since 2×461614157092 (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 46161415709.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46161115709) 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, 23080707854 + 23080707855.
It is an arithmetic number, because the mean of its divisors is an integer number (23080707855).
Almost surely, 246161415709 is an apocalyptic number.
It is an amenable number.
46161415709 is a deficient number, since it is larger than the sum of its proper divisors (1).
46161415709 is an equidigital number, since it uses as much as digits as its factorization.
46161415709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 44.
The spelling of 46161415709 in words is "forty-six billion, one hundred sixty-one million, four hundred fifteen thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •