Base | Representation |
---|---|
bin | 1000000010111110001… |
… | …00110101011110001101 |
3 | 222102121212202002212101 |
4 | 10001133010311132031 |
5 | 14012204042310221 |
6 | 331002052035101 |
7 | 25655154545053 |
oct | 4013704653615 |
9 | 872555662771 |
10 | 276473010061 |
11 | a7284896566 |
12 | 456ba302a91 |
13 | 200c08277a1 |
14 | d54a6741d3 |
15 | 72d1ea3d91 |
hex | 405f13578d |
276473010061 has 4 divisors (see below), whose sum is σ = 276477071872. Its totient is φ = 276468948252.
The previous prime is 276473010031. The next prime is 276473010071. The reversal of 276473010061 is 160010374672.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 276473010061 - 215 = 276472977293 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 276473010061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (276473010031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1927035 + ... + 2065528.
It is an arithmetic number, because the mean of its divisors is an integer number (69119267968).
Almost surely, 2276473010061 is an apocalyptic number.
It is an amenable number.
276473010061 is a deficient number, since it is larger than the sum of its proper divisors (4061811).
276473010061 is an equidigital number, since it uses as much as digits as its factorization.
276473010061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4061810.
The product of its (nonzero) digits is 42336, while the sum is 37.
The spelling of 276473010061 in words is "two hundred seventy-six billion, four hundred seventy-three million, ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •