Base | Representation |
---|---|
bin | 111110011101011… |
… | …1101000000000000 |
3 | 12102001200010220000 |
4 | 1330322331000000 |
5 | 13243013011432 |
6 | 543544520000 |
7 | 102636152415 |
oct | 17472750000 |
9 | 5361603800 |
10 | 2095828992 |
11 | 98604a384 |
12 | 4a5a80000 |
13 | 27528a4ca |
14 | 15c4c210c |
15 | c3ee157c |
hex | 7cebd000 |
2095828992 has 130 divisors (see below), whose sum is σ = 6261839298. Its totient is φ = 698499072.
The previous prime is 2095828981. The next prime is 2095828993. The reversal of 2095828992 is 2998285902.
It can be written as a sum of positive squares in only one way, i.e., 1816805376 + 279023616 = 42624^2 + 16704^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2095828993) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 328618 + ... + 334934.
Almost surely, 22095828992 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 2095828992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3130919649).
2095828992 is an abundant number, since it is smaller than the sum of its proper divisors (4166010306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2095828992 is an frugal number, since it uses more digits than its factorization.
2095828992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6353 (or 6322 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 54.
The square root of 2095828992 is about 45780.2249011514. The cubic root of 2095828992 is about 1279.7307767114.
The spelling of 2095828992 in words is "two billion, ninety-five million, eight hundred twenty-eight thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •