Base | Representation |
---|---|
bin | 110111011100000110… |
… | …1100001111111101001 |
3 | 102101022010100222001201 |
4 | 1232320031201333221 |
5 | 3422310443444344 |
6 | 130405402444201 |
7 | 11413200004441 |
oct | 1567015417751 |
9 | 371263328051 |
10 | 119054671849 |
11 | 46544293093 |
12 | 1b0a7203661 |
13 | b2c43acbb9 |
14 | 5a9598b121 |
15 | 316bec34d4 |
hex | 1bb8361fe9 |
119054671849 has 9 divisors (see below), whose sum is σ = 119496231127. Its totient is φ = 118614742024.
The previous prime is 119054671837. The next prime is 119054671889. The reversal of 119054671849 is 948176450911.
The square root of 119054671849 is 345043.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 28104175449 + 90950496400 = 167643^2 + 301580^2 .
It is not a de Polignac number, because 119054671849 - 211 = 119054669801 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 119054671849.
It is not an unprimeable number, because it can be changed into a prime (119054671829) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 134221284 + ... + 134222170.
Almost surely, 2119054671849 is an apocalyptic number.
119054671849 is the 345043-rd square number.
119054671849 is the 172522-nd centered octagonal number.
It is an amenable number.
119054671849 is a deficient number, since it is larger than the sum of its proper divisors (441559278).
119054671849 is an frugal number, since it uses more digits than its factorization.
119054671849 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2552 (or 1276 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 55.
The spelling of 119054671849 in words is "one hundred nineteen billion, fifty-four million, six hundred seventy-one thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •