Base | Representation |
---|---|
bin | 1100010100010… |
… | …1110011001011 |
3 | 10121012220121010 |
4 | 3011011303023 |
5 | 101211303443 |
6 | 5043215003 |
7 | 1165104045 |
oct | 305056313 |
9 | 117186533 |
10 | 51666123 |
11 | 27189583 |
12 | 15377463 |
13 | a91c892 |
14 | 6c0ca95 |
15 | 4808733 |
hex | 3145ccb |
51666123 has 8 divisors (see below), whose sum is σ = 70056000. Its totient is φ = 33860168.
The previous prime is 51666103. The next prime is 51666137. The reversal of 51666123 is 32166615.
51666123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 51666123 - 210 = 51665099 is a prime.
It is a super-2 number, since 2×516661232 = 5338776531702258, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51666103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145773 + ... + 146126.
It is an arithmetic number, because the mean of its divisors is an integer number (8757000).
Almost surely, 251666123 is an apocalyptic number.
51666123 is a deficient number, since it is larger than the sum of its proper divisors (18389877).
51666123 is a wasteful number, since it uses less digits than its factorization.
51666123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291961.
The product of its digits is 6480, while the sum is 30.
The square root of 51666123 is about 7187.9150662762. The cubic root of 51666123 is about 372.4505539220.
It can be divided in two parts, 5166612 and 3, that added together give a palindrome (5166615).
The spelling of 51666123 in words is "fifty-one million, six hundred sixty-six thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •