Base | Representation |
---|---|
bin | 111111100000001… |
… | …0101101001000000 |
3 | 12111111110121100000 |
4 | 1333000111221000 |
5 | 13330440420242 |
6 | 551234200000 |
7 | 103542313350 |
oct | 17700255100 |
9 | 5444417300 |
10 | 2130795072 |
11 | 9a386196a |
12 | 4b5723000 |
13 | 27c5b09b3 |
14 | 162dc4b60 |
15 | c70eba4c |
hex | 7f015a40 |
2130795072 has 504 divisors, whose sum is σ = 7771481536. Its totient is φ = 566590464.
The previous prime is 2130795053. The next prime is 2130795103. The reversal of 2130795072 is 2705970312.
It is a tau number, because it is divible by the number of its divisors (504).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 57589038 + ... + 57589074.
Almost surely, 22130795072 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 2130795072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3885740768).
2130795072 is an abundant number, since it is smaller than the sum of its proper divisors (5640686464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2130795072 is an equidigital number, since it uses as much as digits as its factorization.
2130795072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117 (or 72 counting only the distinct ones).
The product of its (nonzero) digits is 26460, while the sum is 36.
The square root of 2130795072 is about 46160.5358721062. The cubic root of 2130795072 is about 1286.8084217747.
The spelling of 2130795072 in words is "two billion, one hundred thirty million, seven hundred ninety-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •