Base | Representation |
---|---|
bin | 100100101011010111101010… |
… | …001010111001110101011101 |
3 | 210011011002100022220201111212 |
4 | 210223113222022321311131 |
5 | 132120400402424301444 |
6 | 1331024444214554205 |
7 | 45656156363035256 |
oct | 4453275212716535 |
9 | 704132308821455 |
10 | 161310015462749 |
11 | 4744221442690a |
12 | 16112b65968965 |
13 | 6c01613a6118a |
14 | 2bb9636d1db2d |
15 | 139b09c6ac19e |
hex | 92b5ea2b9d5d |
161310015462749 has 8 divisors (see below), whose sum is σ = 168572125866240. Its totient is φ = 154068624348496.
The previous prime is 161310015462733. The next prime is 161310015462781. The reversal of 161310015462749 is 947264510013161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 161310015462749 - 24 = 161310015462733 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 161310015462697 and 161310015462706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161310015462049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5179806389 + ... + 5179837530.
It is an arithmetic number, because the mean of its divisors is an integer number (21071515733280).
Almost surely, 2161310015462749 is an apocalyptic number.
It is an amenable number.
161310015462749 is a deficient number, since it is larger than the sum of its proper divisors (7262110403491).
161310015462749 is a wasteful number, since it uses less digits than its factorization.
161310015462749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10359644619.
The product of its (nonzero) digits is 1088640, while the sum is 50.
The spelling of 161310015462749 in words is "one hundred sixty-one trillion, three hundred ten billion, fifteen million, four hundred sixty-two thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •