Base | Representation |
---|---|
bin | 100100101011011010000010… |
… | …001001011000010011000000 |
3 | 210011011022221000200210120020 |
4 | 210223122002021120103000 |
5 | 132120421113142400224 |
6 | 1331025545220413440 |
7 | 45656306513325615 |
oct | 4453320211302300 |
9 | 704138830623506 |
10 | 161312565200064 |
11 | 47443302711233 |
12 | 16113557847280 |
13 | 6c0192c086295 |
14 | 2bb97d97da50c |
15 | 139b19b45ec79 |
hex | 92b6822584c0 |
161312565200064 has 56 divisors (see below), whose sum is σ = 429361887698688. Its totient is φ = 53448873888000.
The previous prime is 161312565200063. The next prime is 161312565200077. The reversal of 161312565200064 is 460002565213161.
It is a junction number, because it is equal to n+sod(n) for n = 161312565199989 and 161312565200025.
It is not an unprimeable number, because it can be changed into a prime (161312565200063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2515445812 + ... + 2515509939.
It is an arithmetic number, because the mean of its divisors is an integer number (7667176566048).
Almost surely, 2161312565200064 is an apocalyptic number.
It is an amenable number.
161312565200064 is an abundant number, since it is smaller than the sum of its proper divisors (268049322498624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161312565200064 is a wasteful number, since it uses less digits than its factorization.
161312565200064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5030955933 (or 5030955923 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 161312565200064 in words is "one hundred sixty-one trillion, three hundred twelve billion, five hundred sixty-five million, two hundred thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •