Base | Representation |
---|---|
bin | 110010110100110101… |
… | …0101011111000100100 |
3 | 101102201122022001202011 |
4 | 1211221222223320210 |
5 | 3242013111324001 |
6 | 122050314324004 |
7 | 10612523010214 |
oct | 1455152537044 |
9 | 342648261664 |
10 | 109146979876 |
11 | 4231a696500 |
12 | 191a1129604 |
13 | a3a587207c |
14 | 53d5bb6244 |
15 | 2c8c29ad51 |
hex | 1969aabe24 |
109146979876 has 27 divisors (see below), whose sum is σ = 209964060817. Its totient is φ = 49608959840.
The previous prime is 109146979871. The next prime is 109146979919. The reversal of 109146979876 is 678979641901.
The square root of 109146979876 is 330374.
It is a perfect power (a square), and thus also a powerful number.
109146979876 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 37013912100 + 72133067776 = 192390^2 + 268576^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109146979871) 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 8 ways as a sum of consecutive naturals, for example, 7260720 + ... + 7275736.
Almost surely, 2109146979876 is an apocalyptic number.
109146979876 is the 330374-th square number.
It is an amenable number.
109146979876 is a deficient number, since it is larger than the sum of its proper divisors (100817080941).
109146979876 is an frugal number, since it uses more digits than its factorization.
109146979876 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30060 (or 15030 counting only the distinct ones).
The product of its (nonzero) digits is 41150592, while the sum is 67.
The spelling of 109146979876 in words is "one hundred nine billion, one hundred forty-six million, nine hundred seventy-nine thousand, eight hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •