Base | Representation |
---|---|
bin | 111001000011101000… |
… | …000111010101010101 |
3 | 12212010121021100001012 |
4 | 321003220013111111 |
5 | 2000432104201123 |
6 | 44051102542005 |
7 | 4266116345012 |
oct | 710350072525 |
9 | 185117240035 |
10 | 61264131413 |
11 | 23a89006771 |
12 | ba59297905 |
13 | 5a14616c44 |
14 | 2d72718709 |
15 | 18d870a378 |
hex | e43a07555 |
61264131413 has 2 divisors, whose sum is σ = 61264131414. Its totient is φ = 61264131412.
The previous prime is 61264131389. The next prime is 61264131419. The reversal of 61264131413 is 31413146216.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56464690129 + 4799441284 = 237623^2 + 69278^2 .
It is a cyclic number.
It is not a de Polignac number, because 61264131413 - 26 = 61264131349 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 61264131413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61264131419) 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, 30632065706 + 30632065707.
It is an arithmetic number, because the mean of its divisors is an integer number (30632065707).
Almost surely, 261264131413 is an apocalyptic number.
It is an amenable number.
61264131413 is a deficient number, since it is larger than the sum of its proper divisors (1).
61264131413 is an equidigital number, since it uses as much as digits as its factorization.
61264131413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 32.
Adding to 61264131413 its reverse (31413146216), we get a palindrome (92677277629).
The spelling of 61264131413 in words is "sixty-one billion, two hundred sixty-four million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •