Base | Representation |
---|---|
bin | 10111101001011001011011… |
… | …00010111000010100000111 |
3 | 20211010010220202020211212222 |
4 | 23310230231202320110013 |
5 | 23303431330342432301 |
6 | 302332234534002555 |
7 | 13644604551040253 |
oct | 1364545542702407 |
9 | 224103822224788 |
10 | 51999933170951 |
11 | 15629058704257 |
12 | 59b9b284a645b |
13 | 230275a188c1c |
14 | cbab4b25d263 |
15 | 602986d3b31b |
hex | 2f4b2d8b8507 |
51999933170951 has 16 divisors (see below), whose sum is σ = 52370371821600. Its totient is φ = 51630317600640.
The previous prime is 51999933170923. The next prime is 51999933170971. The reversal of 51999933170951 is 15907133999915.
51999933170951 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 51999933170951 - 214 = 51999933154567 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51999933170971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1028678225 + ... + 1028728773.
It is an arithmetic number, because the mean of its divisors is an integer number (3273148238850).
Almost surely, 251999933170951 is an apocalyptic number.
51999933170951 is a deficient number, since it is larger than the sum of its proper divisors (370438650649).
51999933170951 is a wasteful number, since it uses less digits than its factorization.
51999933170951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58546.
The product of its (nonzero) digits is 93002175, while the sum is 71.
The spelling of 51999933170951 in words is "fifty-one trillion, nine hundred ninety-nine billion, nine hundred thirty-three million, one hundred seventy thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •