Base | Representation |
---|---|
bin | 100100101000010101001100… |
… | …000110011011110001101000 |
3 | 210010102010100222022020111220 |
4 | 210220111030012123301220 |
5 | 132103440231443420322 |
6 | 1330344512155222040 |
7 | 45635115020642040 |
oct | 4450251406336150 |
9 | 703363328266456 |
10 | 161101205060712 |
11 | 473717013a2214 |
12 | 1609a5ab747920 |
13 | 6bb7a17346477 |
14 | 2bad4a8a9c720 |
15 | 139592aa0d55c |
hex | 92854c19bc68 |
161101205060712 has 64 divisors (see below), whose sum is σ = 468973858423680. Its totient is φ = 45160445620992.
The previous prime is 161101205060699. The next prime is 161101205060717. The reversal of 161101205060712 is 217060502101161.
It is not an unprimeable number, because it can be changed into a prime (161101205060717) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9046554723 + ... + 9046572530.
It is an arithmetic number, because the mean of its divisors is an integer number (7327716537870).
Almost surely, 2161101205060712 is an apocalyptic number.
161101205060712 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
161101205060712 is an abundant number, since it is smaller than the sum of its proper divisors (307872653362968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161101205060712 is a wasteful number, since it uses less digits than its factorization.
161101205060712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18093127322 (or 18093127318 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 33.
Adding to 161101205060712 its reverse (217060502101161), we get a palindrome (378161707161873).
The spelling of 161101205060712 in words is "one hundred sixty-one trillion, one hundred one billion, two hundred five million, sixty thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •