Base | Representation |
---|---|
bin | 111111010111010… |
… | …1101101101100000 |
3 | 12111011202212212220 |
4 | 1332232231231200 |
5 | 13323300100242 |
6 | 550551151040 |
7 | 103455122100 |
oct | 17656555540 |
9 | 5434685786 |
10 | 2126175072 |
11 | 9a119688a |
12 | 4b4075480 |
13 | 27b653b78 |
14 | 162541200 |
15 | c69d7bec |
hex | 7ebadb60 |
2126175072 has 144 divisors (see below), whose sum is σ = 6545387520. Its totient is φ = 602525952.
The previous prime is 2126175071. The next prime is 2126175133. The reversal of 2126175072 is 2705716212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2126175071) 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 23 ways as a sum of consecutive naturals, for example, 595629 + ... + 599187.
It is an arithmetic number, because the mean of its divisors is an integer number (45454080).
Almost surely, 22126175072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2126175072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3272693760).
2126175072 is an abundant number, since it is smaller than the sum of its proper divisors (4419212448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2126175072 is a wasteful number, since it uses less digits than its factorization.
2126175072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3713 (or 3698 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 33.
The square root of 2126175072 is about 46110.4659703196. The cubic root of 2126175072 is about 1285.8777274268.
The spelling of 2126175072 in words is "two billion, one hundred twenty-six million, one hundred seventy-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •