Base | Representation |
---|---|
bin | 110101001010011101… |
… | …1011111011110111000 |
3 | 101220200112210210021012 |
4 | 1222110323133132320 |
5 | 3332303422214422 |
6 | 124240431333052 |
7 | 11151120026321 |
oct | 1522473373670 |
9 | 356615723235 |
10 | 114167773112 |
11 | 444668057a8 |
12 | 1a162681188 |
13 | a9c5b01143 |
14 | 575092b448 |
15 | 2e82e5d4e2 |
hex | 1a94edf7b8 |
114167773112 has 64 divisors (see below), whose sum is σ = 220932956160. Its totient is φ = 55274617600.
The previous prime is 114167773099. The next prime is 114167773133. The reversal of 114167773112 is 211377761411.
114167773112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1141677731122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a self number, because there is not a number n which added to its sum of digits gives 114167773112.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31510133 + ... + 31513755.
It is an arithmetic number, because the mean of its divisors is an integer number (3452077440).
Almost surely, 2114167773112 is an apocalyptic number.
It is an amenable number.
114167773112 is a deficient number, since it is larger than the sum of its proper divisors (106765183048).
114167773112 is a wasteful number, since it uses less digits than its factorization.
114167773112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4364 (or 4360 counting only the distinct ones).
The product of its digits is 49392, while the sum is 41.
The spelling of 114167773112 in words is "one hundred fourteen billion, one hundred sixty-seven million, seven hundred seventy-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •