Base | Representation |
---|---|
bin | 1000000000001110110… |
… | …11100001000000010100 |
3 | 222021211101211112022201 |
4 | 10000013123201000110 |
5 | 14001201123414112 |
6 | 330200123134244 |
7 | 25603551124150 |
oct | 4000733410024 |
9 | 867741745281 |
10 | 275002560532 |
11 | a669a85a017 |
12 | 45369974384 |
13 | 1cc17cb09cb |
14 | d44b264060 |
15 | 7247d45257 |
hex | 40076e1014 |
275002560532 has 96 divisors (see below), whose sum is σ = 575111577600. Its totient is φ = 112598356608.
The previous prime is 275002560467. The next prime is 275002560551. The reversal of 275002560532 is 235065200572.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a junction number, because it is equal to n+sod(n) for n = 275002560491 and 275002560500.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66439719 + ... + 66443857.
It is an arithmetic number, because the mean of its divisors is an integer number (5990745600).
Almost surely, 2275002560532 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 275002560532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (287555788800).
275002560532 is an abundant number, since it is smaller than the sum of its proper divisors (300109017068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
275002560532 is a wasteful number, since it uses less digits than its factorization.
275002560532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5333 (or 5331 counting only the distinct ones).
The product of its (nonzero) digits is 126000, while the sum is 37.
The spelling of 275002560532 in words is "two hundred seventy-five billion, two million, five hundred sixty thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •