Base | Representation |
---|---|
bin | 1011111011000… |
… | …0100100110010 |
3 | 10111002120210000 |
4 | 2332300210302 |
5 | 100300200242 |
6 | 4543450430 |
7 | 1145022012 |
oct | 276604462 |
9 | 114076700 |
10 | 50006322 |
11 | 26255543 |
12 | 148b6a16 |
13 | a48b252 |
14 | 68d9c42 |
15 | 45cba4c |
hex | 2fb0932 |
50006322 has 20 divisors (see below), whose sum is σ = 112051566. Its totient is φ = 16668720.
The previous prime is 50006279. The next prime is 50006329. The reversal of 50006322 is 22360005.
50006322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 45684081 + 4322241 = 6759^2 + 2079^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 50006295 and 50006304.
It is not an unprimeable number, because it can be changed into a prime (50006329) 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 9 ways as a sum of consecutive naturals, for example, 154179 + ... + 154502.
Almost surely, 250006322 is an apocalyptic number.
50006322 is an abundant number, since it is smaller than the sum of its proper divisors (62045244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50006322 is a wasteful number, since it uses less digits than its factorization.
50006322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308695 (or 308686 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 18.
The square root of 50006322 is about 7071.5148306427. The cubic root of 50006322 is about 368.4186761744.
Adding to 50006322 its reverse (22360005), we get a palindrome (72366327).
The spelling of 50006322 in words is "fifty million, six thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •