Base | Representation |
---|---|
bin | 100110001001100110000… |
… | …100001001000111000001 |
3 | 100021121220202201101001221 |
4 | 212021212010021013001 |
5 | 320423110424144411 |
6 | 5324211011155041 |
7 | 360256512553411 |
oct | 46114604110701 |
9 | 10247822641057 |
10 | 2621642412481 |
11 | 920917883194 |
12 | 3641128a5a81 |
13 | 1602b1c31bc1 |
14 | 90c611d0641 |
15 | 482dcd92071 |
hex | 262661091c1 |
2621642412481 has 2 divisors, whose sum is σ = 2621642412482. Its totient is φ = 2621642412480.
The previous prime is 2621642412421. The next prime is 2621642412523. The reversal of 2621642412481 is 1842142461262.
It is a happy number.
2621642412481 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1926613400625 + 695029011856 = 1388025^2 + 833684^2 .
It is a cyclic number.
It is not a de Polignac number, because 2621642412481 - 217 = 2621642281409 is a prime.
It is a super-2 number, since 2×26216424124812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2621642412421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1310821206240 + 1310821206241.
It is an arithmetic number, because the mean of its divisors is an integer number (1310821206241).
Almost surely, 22621642412481 is an apocalyptic number.
It is an amenable number.
2621642412481 is a deficient number, since it is larger than the sum of its proper divisors (1).
2621642412481 is an equidigital number, since it uses as much as digits as its factorization.
2621642412481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 294912, while the sum is 43.
The spelling of 2621642412481 in words is "two trillion, six hundred twenty-one billion, six hundred forty-two million, four hundred twelve thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •