Base | Representation |
---|---|
bin | 10000011100101… |
… | …001000011100000 |
3 | 201020020101112010 |
4 | 100130221003200 |
5 | 1031120144043 |
6 | 43214232520 |
7 | 6560324301 |
oct | 2034510340 |
9 | 636211463 |
10 | 275943648 |
11 | 131843602 |
12 | 784b5740 |
13 | 45227286 |
14 | 289107a8 |
15 | 1935b133 |
hex | 107290e0 |
275943648 has 48 divisors (see below), whose sum is σ = 747726336. Its totient is φ = 89013120.
The previous prime is 275943641. The next prime is 275943659. The reversal of 275943648 is 846349572.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×2759436482 = 152289793743095808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 275943597 and 275943606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (275943641) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43386 + ... + 49337.
It is an arithmetic number, because the mean of its divisors is an integer number (15577632).
Almost surely, 2275943648 is an apocalyptic number.
It is an amenable number.
275943648 is an abundant number, since it is smaller than the sum of its proper divisors (471782688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
275943648 is a wasteful number, since it uses less digits than its factorization.
275943648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92767 (or 92759 counting only the distinct ones).
The product of its digits is 1451520, while the sum is 48.
The square root of 275943648 is about 16611.5516433595. The cubic root of 275943648 is about 651.0386927481.
The spelling of 275943648 in words is "two hundred seventy-five million, nine hundred forty-three thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •