Base | Representation |
---|---|
bin | 10011001111111… |
… | …11111101000010 |
3 | 102020212001121210 |
4 | 21213333331002 |
5 | 312314334024 |
6 | 24005030550 |
7 | 4000363446 |
oct | 1147777502 |
9 | 366761553 |
10 | 161480514 |
11 | 83173778 |
12 | 460b5456 |
13 | 275bb600 |
14 | 17636826 |
15 | e29b129 |
hex | 99fff42 |
161480514 has 48 divisors (see below), whose sum is σ = 352220832. Its totient is φ = 49330944.
The previous prime is 161480491. The next prime is 161480521. The reversal of 161480514 is 415084161.
161480514 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 164794 + ... + 165770.
It is an arithmetic number, because the mean of its divisors is an integer number (7337934).
Almost surely, 2161480514 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 161480514, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176110416).
161480514 is an abundant number, since it is smaller than the sum of its proper divisors (190740318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161480514 is a wasteful number, since it uses less digits than its factorization.
161480514 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1171 (or 1158 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 30.
The square root of 161480514 is about 12707.4983375958. The cubic root of 161480514 is about 544.5528571589.
It can be divided in two parts, 1614 and 80514, that added together give a palindrome (82128).
The spelling of 161480514 in words is "one hundred sixty-one million, four hundred eighty thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •