Base | Representation |
---|---|
bin | 101000000101011101101… |
… | …001011110110001110100 |
3 | 100202100012221220121112110 |
4 | 220011131221132301310 |
5 | 330113003132114141 |
6 | 5505244434251020 |
7 | 403005450540411 |
oct | 50053551366164 |
9 | 10670187817473 |
10 | 2754645191796 |
11 | 972269440913 |
12 | 385a51126a70 |
13 | 16c9b9c52014 |
14 | 9747b3c7108 |
15 | 4b9c4647e16 |
hex | 2815da5ec74 |
2754645191796 has 192 divisors, whose sum is σ = 7331412049920. Its totient is φ = 800396277120.
The previous prime is 2754645191723. The next prime is 2754645191801. The reversal of 2754645191796 is 6971915464572.
2754645191796 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27097455 + ... + 27198921.
It is an arithmetic number, because the mean of its divisors is an integer number (38184437760).
Almost surely, 22754645191796 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 2754645191796, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3665706024960).
2754645191796 is an abundant number, since it is smaller than the sum of its proper divisors (4576766858124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2754645191796 is a wasteful number, since it uses less digits than its factorization.
2754645191796 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101714 (or 101712 counting only the distinct ones).
The product of its digits is 114307200, while the sum is 66.
The spelling of 2754645191796 in words is "two trillion, seven hundred fifty-four billion, six hundred forty-five million, one hundred ninety-one thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •