Base | Representation |
---|---|
bin | 11010011010011000011111… |
… | …011011001011101011101010 |
3 | 120020021222222022220122110012 |
4 | 122122120133123023223222 |
5 | 110211200202423111200 |
6 | 1051020103412051522 |
7 | 33316304630346146 |
oct | 3232303733135352 |
9 | 506258868818405 |
10 | 116162212707050 |
11 | 34016132804314 |
12 | 11041022003ba2 |
13 | 4ca808512b283 |
14 | 20983d146c226 |
15 | d669a4514a35 |
hex | 69a61f6cbaea |
116162212707050 has 12 divisors (see below), whose sum is σ = 216061715635206. Its totient is φ = 46464885082800.
The previous prime is 116162212707043. The next prime is 116162212707059. The reversal of 116162212707050 is 50707212261611.
It can be written as a sum of positive squares in 3 ways, for example, as 64322918304649 + 51839294402401 = 8020157^2 + 7199951^2 .
It is a junction number, because it is equal to n+sod(n) for n = 116162212706989 and 116162212707007.
It is not an unprimeable number, because it can be changed into a prime (116162212707059) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1161622127021 + ... + 1161622127120.
Almost surely, 2116162212707050 is an apocalyptic number.
116162212707050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
116162212707050 is a deficient number, since it is larger than the sum of its proper divisors (99899502928156).
116162212707050 is a wasteful number, since it uses less digits than its factorization.
116162212707050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2323244254153 (or 2323244254148 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 41.
Adding to 116162212707050 its reverse (50707212261611), we get a palindrome (166869424968661).
The spelling of 116162212707050 in words is "one hundred sixteen trillion, one hundred sixty-two billion, two hundred twelve million, seven hundred seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •