Base | Representation |
---|---|
bin | 101111100101111000… |
… | …001100000110000011 |
3 | 11212220100012122222122 |
4 | 233211320030012003 |
5 | 1314123421233243 |
6 | 35250423154455 |
7 | 3456224220320 |
oct | 574570140603 |
9 | 155810178878 |
10 | 51101352323 |
11 | 1a74342138a |
12 | 9aa18a5a2b |
13 | 4a84ca50a8 |
14 | 268ab01b47 |
15 | 14e13e6668 |
hex | be5e0c183 |
51101352323 has 8 divisors (see below), whose sum is σ = 58486068480. Its totient is φ = 43737766920.
The previous prime is 51101352287. The next prime is 51101352353. The reversal of 51101352323 is 32325310115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51101352323 - 210 = 51101351299 is a prime.
It is a super-2 number, since 2×511013523232 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51101352292 and 51101352301.
It is not an unprimeable number, because it can be changed into a prime (51101352353) 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 in 7 ways as a sum of consecutive naturals, for example, 5277503 + ... + 5287176.
It is an arithmetic number, because the mean of its divisors is an integer number (7310758560).
Almost surely, 251101352323 is an apocalyptic number.
51101352323 is a deficient number, since it is larger than the sum of its proper divisors (7384716157).
51101352323 is a wasteful number, since it uses less digits than its factorization.
51101352323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10565377.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 51101352323 its reverse (32325310115), we get a palindrome (83426662438).
The spelling of 51101352323 in words is "fifty-one billion, one hundred one million, three hundred fifty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •