Base | Representation |
---|---|
bin | 110111100101001100… |
… | …1110000100010111100 |
3 | 102102002101122111012100 |
4 | 1233022121300202330 |
5 | 3423422111221233 |
6 | 130455544105100 |
7 | 11423564062431 |
oct | 1571231604274 |
9 | 372071574170 |
10 | 119359867068 |
11 | 46690595842 |
12 | 1b171465190 |
13 | b3426a95a0 |
14 | 5ac4313b88 |
15 | 3188bab813 |
hex | 1bca6708bc |
119359867068 has 144 divisors (see below), whose sum is σ = 328942213600. Its totient is φ = 36274106880.
The previous prime is 119359867037. The next prime is 119359867103. The reversal of 119359867068 is 860768953911.
It is a junction number, because it is equal to n+sod(n) for n = 119359866996 and 119359867014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16881438 + ... + 16888506.
Almost surely, 2119359867068 is an apocalyptic number.
119359867068 is a gapful number since it is divisible by the number (18) 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 119359867068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164471106800).
119359867068 is an abundant number, since it is smaller than the sum of its proper divisors (209582346532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
119359867068 is a wasteful number, since it uses less digits than its factorization.
119359867068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7532 (or 7527 counting only the distinct ones).
The product of its (nonzero) digits is 19595520, while the sum is 63.
The spelling of 119359867068 in words is "one hundred nineteen billion, three hundred fifty-nine million, eight hundred sixty-seven thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •