Base | Representation |
---|---|
bin | 10011001101101011… |
… | …01110000001011001 |
3 | 222121220001011111001 |
4 | 21212311232001121 |
5 | 132111203332021 |
6 | 4423324305001 |
7 | 513423353554 |
oct | 114665560131 |
9 | 28556034431 |
10 | 10315292761 |
11 | 4413794144 |
12 | 1bba6a2161 |
13 | c85110c37 |
14 | 6dbd9769b |
15 | 4058dd091 |
hex | 266d6e059 |
10315292761 has 2 divisors, whose sum is σ = 10315292762. Its totient is φ = 10315292760.
The previous prime is 10315292753. The next prime is 10315292803. The reversal of 10315292761 is 16729251301.
10315292761 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9593027136 + 722265625 = 97944^2 + 26875^2 .
It is a cyclic number.
It is not a de Polignac number, because 10315292761 - 23 = 10315292753 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10315292761.
It is not a weakly prime, because it can be changed into another prime (10315292461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5157646380 + 5157646381.
It is an arithmetic number, because the mean of its divisors is an integer number (5157646381).
Almost surely, 210315292761 is an apocalyptic number.
It is an amenable number.
10315292761 is a deficient number, since it is larger than the sum of its proper divisors (1).
10315292761 is an equidigital number, since it uses as much as digits as its factorization.
10315292761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 37.
The spelling of 10315292761 in words is "ten billion, three hundred fifteen million, two hundred ninety-two thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •