Base | Representation |
---|---|
bin | 1100001011001… |
… | …1011000110110 |
3 | 10120002102221222 |
4 | 3002303120312 |
5 | 101033111142 |
6 | 5022310342 |
7 | 1160025461 |
oct | 302633066 |
9 | 116072858 |
10 | 51066422 |
11 | 26909a60 |
12 | 151283b2 |
13 | a76c924 |
14 | 6ad42d8 |
15 | 473abd2 |
hex | 30b3636 |
51066422 has 16 divisors (see below), whose sum is σ = 83883600. Its totient is φ = 23123040.
The previous prime is 51066409. The next prime is 51066451. The reversal of 51066422 is 22466015.
51066422 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 51066391 and 51066400.
It is a congruent number.
It is an unprimeable number.
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, 1604 + ... + 10232.
It is an arithmetic number, because the mean of its divisors is an integer number (5242725).
Almost surely, 251066422 is an apocalyptic number.
51066422 is a deficient number, since it is larger than the sum of its proper divisors (32817178).
51066422 is a wasteful number, since it uses less digits than its factorization.
51066422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8911.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 51066422 is about 7146.0773855312. The cubic root of 51066422 is about 371.0039014128.
The spelling of 51066422 in words is "fifty-one million, sixty-six thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •