Base | Representation |
---|---|
bin | 110000110100010000… |
… | …1100011010010001001 |
3 | 101000120222111002112221 |
4 | 1201220201203102021 |
5 | 3204144201401331 |
6 | 120054243334041 |
7 | 10400566305331 |
oct | 1415041432211 |
9 | 330528432487 |
10 | 104832840841 |
11 | 40506450a43 |
12 | 18398381321 |
13 | 9b68b42091 |
14 | 5106c4c0c1 |
15 | 2ad8672711 |
hex | 1868863489 |
104832840841 has 9 divisors (see below), whose sum is σ = 110647247463. Its totient is φ = 99309494880.
The previous prime is 104832840829. The next prime is 104832840899. The reversal of 104832840841 is 148048238401.
The square root of 104832840841 is 323779.
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., 95220999241 + 9611841600 = 308579^2 + 98040^2 .
It is not a de Polignac number, because 104832840841 - 225 = 104799286409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104832840941) 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, 6143281 + ... + 6160321.
It is an arithmetic number, because the mean of its divisors is an integer number (12294138607).
Almost surely, 2104832840841 is an apocalyptic number.
104832840841 is the 323779-th square number.
104832840841 is the 161890-th centered octagonal number.
It is an amenable number.
104832840841 is a deficient number, since it is larger than the sum of its proper divisors (5814406622).
104832840841 is an frugal number, since it uses more digits than its factorization.
104832840841 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34120 (or 17060 counting only the distinct ones).
The product of its (nonzero) digits is 196608, while the sum is 43.
The spelling of 104832840841 in words is "one hundred four billion, eight hundred thirty-two million, eight hundred forty thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.216 sec. • engine limits •