Base | Representation |
---|---|
bin | 1000101001011011… |
… | …10010110011111101 |
3 | 102222112201021000020 |
4 | 10110231302303331 |
5 | 34001441004341 |
6 | 2044401122353 |
7 | 223021510500 |
oct | 42455626375 |
9 | 12875637006 |
10 | 4642516221 |
11 | 1a72641172 |
12 | a969293b9 |
13 | 58ca85225 |
14 | 320807137 |
15 | 1c2890566 |
hex | 114b72cfd |
4642516221 has 48 divisors (see below), whose sum is σ = 7600881600. Its totient is φ = 2506194432.
The previous prime is 4642516217. The next prime is 4642516231. The reversal of 4642516221 is 1226152464.
It is not a de Polignac number, because 4642516221 - 22 = 4642516217 is a prime.
It is a super-3 number, since 3×46425162213 (a number of 30 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4642516211) 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 47 ways as a sum of consecutive naturals, for example, 1084341 + ... + 1088613.
It is an arithmetic number, because the mean of its divisors is an integer number (158351700).
Almost surely, 24642516221 is an apocalyptic number.
It is an amenable number.
4642516221 is a deficient number, since it is larger than the sum of its proper divisors (2958365379).
4642516221 is a wasteful number, since it uses less digits than its factorization.
4642516221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4698 (or 4691 counting only the distinct ones).
The product of its digits is 23040, while the sum is 33.
The square root of 4642516221 is about 68136.0126585053. The cubic root of 4642516221 is about 1668.2116250507.
Adding to 4642516221 its reverse (1226152464), we get a palindrome (5868668685).
The spelling of 4642516221 in words is "four billion, six hundred forty-two million, five hundred sixteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •