Base | Representation |
---|---|
bin | 1011100110010111… |
… | …01110101101100010 |
3 | 121001222222211002010 |
4 | 11303023232231202 |
5 | 100223210001200 |
6 | 2505535133350 |
7 | 310215133263 |
oct | 56313565542 |
9 | 17058884063 |
10 | 6227422050 |
11 | 27062433a3 |
12 | 1259674256 |
13 | 783234825 |
14 | 4310cc96a |
15 | 266aac150 |
hex | 1732eeb62 |
6227422050 has 48 divisors (see below), whose sum is σ = 15448832640. Its totient is φ = 1660127040.
The previous prime is 6227421973. The next prime is 6227422057. The reversal of 6227422050 is 502247226.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 6227421999 and 6227422017.
It is not an unprimeable number, because it can be changed into a prime (6227422057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 857836 + ... + 865064.
It is an arithmetic number, because the mean of its divisors is an integer number (321850680).
Almost surely, 26227422050 is an apocalyptic number.
6227422050 is an abundant number, since it is smaller than the sum of its proper divisors (9221410590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6227422050 is a wasteful number, since it uses less digits than its factorization.
6227422050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12987 (or 12982 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 30.
The square root of 6227422050 is about 78914.0168157723. The cubic root of 6227422050 is about 1839.7949962608.
Adding to 6227422050 its reverse (502247226), we get a palindrome (6729669276).
The spelling of 6227422050 in words is "six billion, two hundred twenty-seven million, four hundred twenty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •