Base | Representation |
---|---|
bin | 100100100111100101111000… |
… | …010101111001010111110100 |
3 | 210010020021020211010011011220 |
4 | 210213211320111321113310 |
5 | 132102122213333012202 |
6 | 1330305311431430340 |
7 | 45631336144352226 |
oct | 4447457025712764 |
9 | 703207224104156 |
10 | 161050407704052 |
11 | 47352104634319 |
12 | 160907938253b0 |
13 | 6bb2cb033aa89 |
14 | 2baac4a4d0416 |
15 | 1394456164abc |
hex | 9279785795f4 |
161050407704052 has 48 divisors (see below), whose sum is σ = 398207809440000. Its totient is φ = 50485165166592.
The previous prime is 161050407704051. The next prime is 161050407704059. The reversal of 161050407704052 is 250407704050161.
It is a junction number, because it is equal to n+sod(n) for n = 161050407703995 and 161050407704013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161050407704051) 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, 315783148 + ... + 316292739.
It is an arithmetic number, because the mean of its divisors is an integer number (8295996030000).
Almost surely, 2161050407704052 is an apocalyptic number.
161050407704052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
161050407704052 is an abundant number, since it is smaller than the sum of its proper divisors (237157401735948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161050407704052 is a wasteful number, since it uses less digits than its factorization.
161050407704052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 632077160 (or 632077158 counting only the distinct ones).
The product of its (nonzero) digits is 235200, while the sum is 42.
The spelling of 161050407704052 in words is "one hundred sixty-one trillion, fifty billion, four hundred seven million, seven hundred four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •