Base | Representation |
---|---|
bin | 101100010000001000011… |
… | …1010100000000101111101 |
3 | 210112102121001222000111111 |
4 | 1120200100322200011331 |
5 | 1244121322102244042 |
6 | 20534002423522021 |
7 | 1165256401310215 |
oct | 130402072400575 |
9 | 23472531860444 |
10 | 6081957462397 |
11 | 1a35386481a53 |
12 | 8228832b9311 |
13 | 3516abb9738b |
14 | 17052290d245 |
15 | a8314215517 |
hex | 58810ea017d |
6081957462397 has 2 divisors, whose sum is σ = 6081957462398. Its totient is φ = 6081957462396.
The previous prime is 6081957462311. The next prime is 6081957462419. The reversal of 6081957462397 is 7932647591806.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4852772815801 + 1229184646596 = 2202901^2 + 1108686^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6081957462397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6081957462797) 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, 3040978731198 + 3040978731199.
It is an arithmetic number, because the mean of its divisors is an integer number (3040978731199).
It is a 1-persistent number, because it is pandigital, but 2⋅6081957462397 = 12163914924794 is not.
Almost surely, 26081957462397 is an apocalyptic number.
It is an amenable number.
6081957462397 is a deficient number, since it is larger than the sum of its proper divisors (1).
6081957462397 is an equidigital number, since it uses as much as digits as its factorization.
6081957462397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 137168640, while the sum is 67.
The spelling of 6081957462397 in words is "six trillion, eighty-one billion, nine hundred fifty-seven million, four hundred sixty-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •