Base | Representation |
---|---|
bin | 1101100001101000… |
… | …01010100100010001 |
3 | 200202001122222011221 |
4 | 12300310022210101 |
5 | 104332411311311 |
6 | 3200313405041 |
7 | 344642103631 |
oct | 66064124421 |
9 | 20661588157 |
10 | 7261432081 |
11 | 3096986442 |
12 | 14a7a09781 |
13 | 8b951bc97 |
14 | 4cc5706c1 |
15 | 2c775a671 |
hex | 1b0d0a911 |
7261432081 has 2 divisors, whose sum is σ = 7261432082. Its totient is φ = 7261432080.
The previous prime is 7261432001. The next prime is 7261432091. The reversal of 7261432081 is 1802341627.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5559044481 + 1702387600 = 74559^2 + 41260^2 .
It is an emirp because it is prime and its reverse (1802341627) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7261432081 - 27 = 7261431953 is a prime.
It is a super-2 number, since 2×72614320812 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (7261432001) 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 as a sum of consecutive naturals, namely, 3630716040 + 3630716041.
It is an arithmetic number, because the mean of its divisors is an integer number (3630716041).
Almost surely, 27261432081 is an apocalyptic number.
It is an amenable number.
7261432081 is a deficient number, since it is larger than the sum of its proper divisors (1).
7261432081 is an equidigital number, since it uses as much as digits as its factorization.
7261432081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 34.
The square root of 7261432081 is about 85214.0368777351. The cubic root of 7261432081 is about 1936.4550774665.
The spelling of 7261432081 in words is "seven billion, two hundred sixty-one million, four hundred thirty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •