Base | Representation |
---|---|
bin | 10011001100100… |
… | …11011101011011 |
3 | 102020000111000212 |
4 | 21212103131123 |
5 | 312211123443 |
6 | 23551321335 |
7 | 3663533033 |
oct | 1146233533 |
9 | 366014025 |
10 | 161036123 |
11 | 8299a906 |
12 | 45b2024b |
13 | 27494261 |
14 | 1755c8c3 |
15 | e20e618 |
hex | 999375b |
161036123 has 2 divisors, whose sum is σ = 161036124. Its totient is φ = 161036122.
The previous prime is 161036119. The next prime is 161036131. The reversal of 161036123 is 321630161.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (321630161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 161036123 - 22 = 161036119 is a prime.
It is a super-2 number, since 2×1610361232 = 51865265821742258, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is not a weakly prime, because it can be changed into another prime (161033123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80518061 + 80518062.
It is an arithmetic number, because the mean of its divisors is an integer number (80518062).
Almost surely, 2161036123 is an apocalyptic number.
161036123 is a deficient number, since it is larger than the sum of its proper divisors (1).
161036123 is an equidigital number, since it uses as much as digits as its factorization.
161036123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
The square root of 161036123 is about 12690.0009062253. Note that the first 3 decimals coincide. The cubic root of 161036123 is about 544.0528655281.
Subtracting from 161036123 its sum of digits (23), we obtain a square (161036100 = 126902).
Adding to 161036123 its reverse (321630161), we get a palindrome (482666284).
The spelling of 161036123 in words is "one hundred sixty-one million, thirty-six thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •