Base | Representation |
---|---|
bin | 10111010010100010101101… |
… | …11000110111100111110001 |
3 | 20201100001221212020222222202 |
4 | 23221101112320313213301 |
5 | 23203100044313122334 |
6 | 300531403454512545 |
7 | 13534064500305413 |
oct | 1351212670674761 |
9 | 221301855228882 |
10 | 51214647785969 |
11 | 1535601256a618 |
12 | 58b18a9b05755 |
13 | 227669c8a6b55 |
14 | c90b332709b3 |
15 | 5dc32578a17e |
hex | 2e9456e379f1 |
51214647785969 has 2 divisors, whose sum is σ = 51214647785970. Its totient is φ = 51214647785968.
The previous prime is 51214647785911. The next prime is 51214647785989. The reversal of 51214647785969 is 96958774641215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42034281058225 + 9180366727744 = 6483385^2 + 3029912^2 .
It is a cyclic number.
It is not a de Polignac number, because 51214647785969 - 216 = 51214647720433 is a prime.
It is a super-2 number, since 2×512146477859692 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51214647785896 and 51214647785905.
It is not a weakly prime, because it can be changed into another prime (51214647785989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25607323892984 + 25607323892985.
It is an arithmetic number, because the mean of its divisors is an integer number (25607323892985).
Almost surely, 251214647785969 is an apocalyptic number.
It is an amenable number.
51214647785969 is a deficient number, since it is larger than the sum of its proper divisors (1).
51214647785969 is an equidigital number, since it uses as much as digits as its factorization.
51214647785969 is an evil number, because the sum of its binary digits is even.
The product of its digits is 914457600, while the sum is 74.
The spelling of 51214647785969 in words is "fifty-one trillion, two hundred fourteen billion, six hundred forty-seven million, seven hundred eighty-five thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •