Base | Representation |
---|---|
bin | 101111101111111011… |
… | …011111100111001011 |
3 | 11220100002112101120100 |
4 | 233233323133213023 |
5 | 1320000104201414 |
6 | 35315245500443 |
7 | 3463342506003 |
oct | 575773374713 |
9 | 156302471510 |
10 | 51269990859 |
11 | 1a81a633a7a |
12 | 9b2a271723 |
13 | 4ab0bcb7c9 |
14 | 26a527d003 |
15 | 1501108609 |
hex | befedf9cb |
51269990859 has 6 divisors (see below), whose sum is σ = 74056653476. Its totient is φ = 34179993900.
The previous prime is 51269990819. The next prime is 51269990869. The reversal of 51269990859 is 95809996215.
51269990859 is a `hidden beast` number, since 512 + 69 + 9 + 9 + 0 + 8 + 59 = 666.
It is a de Polignac number, because none of the positive numbers 2k-51269990859 is a prime.
It is a super-2 number, since 2×512699908592 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51269990796 and 51269990805.
It is not an unprimeable number, because it can be changed into a prime (51269990809) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2848332817 + ... + 2848332834.
Almost surely, 251269990859 is an apocalyptic number.
51269990859 is a deficient number, since it is larger than the sum of its proper divisors (22786662617).
51269990859 is a wasteful number, since it uses less digits than its factorization.
51269990859 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5696665657 (or 5696665654 counting only the distinct ones).
The product of its (nonzero) digits is 15746400, while the sum is 63.
The spelling of 51269990859 in words is "fifty-one billion, two hundred sixty-nine million, nine hundred ninety thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •