Base | Representation |
---|---|
bin | 1001011000100011101… |
… | …0101000011010010101 |
3 | 120102010001200021022020 |
4 | 2112020322220122111 |
5 | 10120124440024310 |
6 | 202020444123353 |
7 | 14434645465542 |
oct | 2261072503225 |
9 | 512101607266 |
10 | 161210861205 |
11 | 624073680a9 |
12 | 272b1236559 |
13 | 12282094944 |
14 | 7b3466dbc9 |
15 | 42d7e21170 |
hex | 2588ea8695 |
161210861205 has 8 divisors (see below), whose sum is σ = 257937377952. Its totient is φ = 85979125968.
The previous prime is 161210861113. The next prime is 161210861209. The reversal of 161210861205 is 502168012161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 161210861205 - 28 = 161210860949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161210861209) 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, 5373695359 + ... + 5373695388.
It is an arithmetic number, because the mean of its divisors is an integer number (32242172244).
Almost surely, 2161210861205 is an apocalyptic number.
161210861205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
161210861205 is a deficient number, since it is larger than the sum of its proper divisors (96726516747).
161210861205 is a wasteful number, since it uses less digits than its factorization.
161210861205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10747390755.
The product of its (nonzero) digits is 5760, while the sum is 33.
Adding to 161210861205 its reverse (502168012161), we get a palindrome (663378873366).
The spelling of 161210861205 in words is "one hundred sixty-one billion, two hundred ten million, eight hundred sixty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •