Base | Representation |
---|---|
bin | 10000011110101… |
… | …000010111100001 |
3 | 201021012212211221 |
4 | 100132220113201 |
5 | 1031233340441 |
6 | 43233335041 |
7 | 6564625522 |
oct | 2036502741 |
9 | 637185757 |
10 | 276465121 |
11 | 13206a379 |
12 | 78707481 |
13 | 4537a73a |
14 | 28a08849 |
15 | 194108d1 |
hex | 107a85e1 |
276465121 has 4 divisors (see below), whose sum is σ = 276540100. Its totient is φ = 276390144.
The previous prime is 276465107. The next prime is 276465191. The reversal of 276465121 is 121564672.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 70140625 + 206324496 = 8375^2 + 14364^2 .
It is a cyclic number.
It is not a de Polignac number, because 276465121 - 221 = 274367969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (276465191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31656 + ... + 39433.
It is an arithmetic number, because the mean of its divisors is an integer number (69135025).
Almost surely, 2276465121 is an apocalyptic number.
It is an amenable number.
276465121 is a deficient number, since it is larger than the sum of its proper divisors (74979).
276465121 is an equidigital number, since it uses as much as digits as its factorization.
276465121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74978.
The product of its digits is 20160, while the sum is 34.
The square root of 276465121 is about 16627.2403302532. The cubic root of 276465121 is about 651.4485414827.
It can be divided in two parts, 2764651 and 21, that added together give a palindrome (2764672).
The spelling of 276465121 in words is "two hundred seventy-six million, four hundred sixty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •