Base | Representation |
---|---|
bin | 101011100011001011001… |
… | …1011001011000001011011 |
3 | 210012012101201210201202201 |
4 | 1113012112123023001123 |
5 | 1241031111231230023 |
6 | 20421354424111031 |
7 | 1155301055216116 |
oct | 127062633130133 |
9 | 23165351721681 |
10 | 5985413148763 |
11 | 19a84437571a4 |
12 | 80801a905477 |
13 | 3455642aa189 |
14 | 1699a47d357d |
15 | a5a63582bad |
hex | 571966cb05b |
5985413148763 has 2 divisors, whose sum is σ = 5985413148764. Its totient is φ = 5985413148762.
The previous prime is 5985413148761. The next prime is 5985413148797. The reversal of 5985413148763 is 3678413145895.
5985413148763 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5985413148763 - 21 = 5985413148761 is a prime.
It is a super-2 number, since 2×59854131487632 (a number of 26 digits) contains 22 as substring.
Together with 5985413148761, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5985413148695 and 5985413148704.
It is not a weakly prime, because it can be changed into another prime (5985413148761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2992706574381 + 2992706574382.
It is an arithmetic number, because the mean of its divisors is an integer number (2992706574382).
Almost surely, 25985413148763 is an apocalyptic number.
5985413148763 is a deficient number, since it is larger than the sum of its proper divisors (1).
5985413148763 is an equidigital number, since it uses as much as digits as its factorization.
5985413148763 is an evil number, because the sum of its binary digits is even.
The product of its digits is 87091200, while the sum is 64.
The spelling of 5985413148763 in words is "five trillion, nine hundred eighty-five billion, four hundred thirteen million, one hundred forty-eight thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •