Base | Representation |
---|---|
bin | 110111011000011001… |
… | …1110100011010100010 |
3 | 102100222110200221000120 |
4 | 1232300303310122202 |
5 | 3422032201203132 |
6 | 130345205101110 |
7 | 11410131331326 |
oct | 1566063643242 |
9 | 370873627016 |
10 | 118930491042 |
11 | 46490186220 |
12 | 1b0716b7796 |
13 | b2a475102c |
14 | 5a832a3986 |
15 | 316114402c |
hex | 1bb0cf46a2 |
118930491042 has 32 divisors (see below), whose sum is σ = 259779369024. Its totient is φ = 35998617600.
The previous prime is 118930491023. The next prime is 118930491047. The reversal of 118930491042 is 240194039811.
It is a super-3 number, since 3×1189304910423 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 118930490985 and 118930491003.
It is not an unprimeable number, because it can be changed into a prime (118930491047) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 964543 + ... + 1080834.
It is an arithmetic number, because the mean of its divisors is an integer number (8118105282).
Almost surely, 2118930491042 is an apocalyptic number.
118930491042 is an abundant number, since it is smaller than the sum of its proper divisors (140848877982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
118930491042 is a wasteful number, since it uses less digits than its factorization.
118930491042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2046274.
The product of its (nonzero) digits is 62208, while the sum is 42.
The spelling of 118930491042 in words is "one hundred eighteen billion, nine hundred thirty million, four hundred ninety-one thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •