Base | Representation |
---|---|
bin | 1011100101011000000… |
… | …0011101000111011001 |
3 | 201000200110011102022021 |
4 | 2321112000131013121 |
5 | 11230033413033244 |
6 | 231231414054441 |
7 | 20243455313632 |
oct | 2712600350731 |
9 | 630613142267 |
10 | 199011455449 |
11 | 77444862034 |
12 | 326a064a421 |
13 | 159c7593181 |
14 | 98bcab6889 |
15 | 529b7a7284 |
hex | 2e5601d1d9 |
199011455449 has 9 divisors (see below), whose sum is σ = 206123955583. Its totient is φ = 192136500472.
The previous prime is 199011455437. The next prime is 199011455491. The reversal of 199011455449 is 944554110991.
The square root of 199011455449 is 446107.
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., 104356779849 + 94654675600 = 323043^2 + 307660^2 .
It is not a de Polignac number, because 199011455449 - 215 = 199011422681 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 199011455396 and 199011455405.
It is not an unprimeable number, because it can be changed into a prime (199011455549) 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, 12929412 + ... + 12944794.
Almost surely, 2199011455449 is an apocalyptic number.
199011455449 is the 446107-th square number.
199011455449 is the 223054-th centered octagonal number.
It is an amenable number.
199011455449 is a deficient number, since it is larger than the sum of its proper divisors (7112500134).
199011455449 is an frugal number, since it uses more digits than its factorization.
199011455449 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30824 (or 15412 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 52.
The spelling of 199011455449 in words is "one hundred ninety-nine billion, eleven million, four hundred fifty-five thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •