Base | Representation |
---|---|
bin | 1001111110011111… |
… | …1010111000111100 |
3 | 20220122012122020010 |
4 | 2133213322320330 |
5 | 20441034322142 |
6 | 1121423423220 |
7 | 123235661061 |
oct | 23747727074 |
9 | 6818178203 |
10 | 2678042172 |
11 | 11547597a3 |
12 | 628a54b10 |
13 | 338a99150 |
14 | 1b5958c68 |
15 | 10a198e9c |
hex | 9f9fae3c |
2678042172 has 96 divisors (see below), whose sum is σ = 7173913600. Its totient is φ = 770694912.
The previous prime is 2678042137. The next prime is 2678042179. The reversal of 2678042172 is 2712408762.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 2678042172.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2678042179) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 228438 + ... + 239874.
Almost surely, 22678042172 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 2678042172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3586956800).
2678042172 is an abundant number, since it is smaller than the sum of its proper divisors (4495871428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2678042172 is a wasteful number, since it uses less digits than its factorization.
2678042172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11555 (or 11553 counting only the distinct ones).
The product of its (nonzero) digits is 75264, while the sum is 39.
The square root of 2678042172 is about 51749.8035938302. The cubic root of 2678042172 is about 1388.6915852202.
The spelling of 2678042172 in words is "two billion, six hundred seventy-eight million, forty-two thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •