Base | Representation |
---|---|
bin | 101011101110101010… |
… | …101101101101101101 |
3 | 11111012021221121011212 |
4 | 223232222231231231 |
5 | 1232130141111121 |
6 | 33323103524205 |
7 | 3251363056100 |
oct | 535652555555 |
9 | 144167847155 |
10 | 46953847661 |
11 | 18a0524a786 |
12 | 91248b9665 |
13 | 4573949516 |
14 | 23b5d52737 |
15 | 134c23625b |
hex | aeeaadb6d |
46953847661 has 6 divisors (see below), whose sum is σ = 54619782030. Its totient is φ = 40246155096.
The previous prime is 46953847649. The next prime is 46953847669. The reversal of 46953847661 is 16674835964.
It can be written as a sum of positive squares in only one way, i.e., 38210475625 + 8743372036 = 195475^2 + 93506^2 .
It is not a de Polignac number, because 46953847661 - 230 = 45880105837 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 46953847661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46953847669) 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 in 5 ways as a sum of consecutive naturals, for example, 479120846 + ... + 479120943.
It is an arithmetic number, because the mean of its divisors is an integer number (9103297005).
Almost surely, 246953847661 is an apocalyptic number.
It is an amenable number.
46953847661 is a deficient number, since it is larger than the sum of its proper divisors (7665934369).
46953847661 is an equidigital number, since it uses as much as digits as its factorization.
46953847661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 958241803 (or 958241796 counting only the distinct ones).
The product of its digits is 26127360, while the sum is 59.
The spelling of 46953847661 in words is "forty-six billion, nine hundred fifty-three million, eight hundred forty-seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •