Base | Representation |
---|---|
bin | 1011010111010001… |
… | …1101111100001101 |
3 | 21212120220220121002 |
4 | 2311310131330031 |
5 | 22221402231341 |
6 | 1222405150045 |
7 | 135410141366 |
oct | 26564357415 |
9 | 7776826532 |
10 | 3050430221 |
11 | 1325985413 |
12 | 7116bb325 |
13 | 397c906c7 |
14 | 20d1b2b6d |
15 | 12cc0629b |
hex | b5d1df0d |
3050430221 has 16 divisors (see below), whose sum is σ = 3329467200. Its totient is φ = 2783708928.
The previous prime is 3050430209. The next prime is 3050430263. The reversal of 3050430221 is 1220340503.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 3050430221 - 214 = 3050413837 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3050430193 and 3050430202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3050430281) 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 15 ways as a sum of consecutive naturals, for example, 237845 + ... + 250341.
It is an arithmetic number, because the mean of its divisors is an integer number (208091700).
Almost surely, 23050430221 is an apocalyptic number.
It is an amenable number.
3050430221 is a deficient number, since it is larger than the sum of its proper divisors (279036979).
3050430221 is a wasteful number, since it uses less digits than its factorization.
3050430221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12988.
The product of its (nonzero) digits is 720, while the sum is 20.
The square root of 3050430221 is about 55230.6999865111. The cubic root of 3050430221 is about 1450.2861458266.
Adding to 3050430221 its reverse (1220340503), we get a palindrome (4270770724).
The spelling of 3050430221 in words is "three billion, fifty million, four hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •