Base | Representation |
---|---|
bin | 1010010100000111… |
… | …1101010101110000 |
3 | 21010221220021111122 |
4 | 2211001331111300 |
5 | 21132300112112 |
6 | 1134424001412 |
7 | 125420010122 |
oct | 24501752560 |
9 | 7127807448 |
10 | 2768754032 |
11 | 11a0986980 |
12 | 653300268 |
13 | 35180a0c5 |
14 | 1c3a0d212 |
15 | 113116872 |
hex | a507d570 |
2768754032 has 80 divisors (see below), whose sum is σ = 5955889632. Its totient is φ = 1236418560.
The previous prime is 2768754031. The next prime is 2768754049. The reversal of 2768754032 is 2304578672.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2768754031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2679788 + ... + 2680820.
Almost surely, 22768754032 is an apocalyptic number.
2768754032 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2768754032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2977944816).
2768754032 is an abundant number, since it is smaller than the sum of its proper divisors (3187135600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2768754032 is a wasteful number, since it uses less digits than its factorization.
2768754032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1306 (or 1300 counting only the distinct ones).
The product of its (nonzero) digits is 564480, while the sum is 44.
The square root of 2768754032 is about 52618.9512628293. The cubic root of 2768754032 is about 1404.1972731680.
The spelling of 2768754032 in words is "two billion, seven hundred sixty-eight million, seven hundred fifty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •