Base | Representation |
---|---|
bin | 1001011000000000000… |
… | …0001011101001010100 |
3 | 120101201122021212010020 |
4 | 2112000000023221110 |
5 | 10114323144240200 |
6 | 201553543025140 |
7 | 14431151433255 |
oct | 2260000135124 |
9 | 511648255106 |
10 | 161061321300 |
11 | 6233aa0a600 |
12 | 2726b13b1b0 |
13 | 1225a0c72a9 |
14 | 7b1c864b2c |
15 | 42c9c32ea0 |
hex | 258000ba54 |
161061321300 has 216 divisors, whose sum is σ = 513452428608. Its totient is φ = 38951193600.
The previous prime is 161061321299. The next prime is 161061321353. The reversal of 161061321300 is 3123160161.
161061321300 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 15712777 + ... + 15723023.
Almost surely, 2161061321300 is an apocalyptic number.
161061321300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 161061321300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (256726214304).
161061321300 is an abundant number, since it is smaller than the sum of its proper divisors (352391107308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161061321300 is a wasteful number, since it uses less digits than its factorization.
161061321300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10719 (or 10701 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 161061321300 its reverse (3123160161), we get a palindrome (164184481461).
The spelling of 161061321300 in words is "one hundred sixty-one billion, sixty-one million, three hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •