Base | Representation |
---|---|
bin | 11110111011001101110… |
… | …001000100000111110101 |
3 | 21112011102110211020211122 |
4 | 132323031301010013311 |
5 | 234304320001113240 |
6 | 4304142055313325 |
7 | 306352411152215 |
oct | 36731561040765 |
9 | 7464373736748 |
10 | 2125166035445 |
11 | 74a306907892 |
12 | 2a3a5597b845 |
13 | 12552cb01c3b |
14 | 74c03d58245 |
15 | 3a4317854b5 |
hex | 1eecdc441f5 |
2125166035445 has 8 divisors (see below), whose sum is σ = 2573595566520. Its totient is φ = 1684535279040.
The previous prime is 2125166035393. The next prime is 2125166035483. The reversal of 2125166035445 is 5445306615212.
It can be written as a sum of positive squares in 4 ways, for example, as 101608575121 + 2023557460324 = 318761^2 + 1422518^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2125166035445 - 26 = 2125166035381 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2125166035396 and 2125166035405.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1949693066 + ... + 1949694155.
It is an arithmetic number, because the mean of its divisors is an integer number (321699445815).
Almost surely, 22125166035445 is an apocalyptic number.
It is an amenable number.
2125166035445 is a deficient number, since it is larger than the sum of its proper divisors (448429531075).
2125166035445 is a wasteful number, since it uses less digits than its factorization.
2125166035445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3899387335.
The product of its (nonzero) digits is 864000, while the sum is 44.
The spelling of 2125166035445 in words is "two trillion, one hundred twenty-five billion, one hundred sixty-six million, thirty-five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •