Base | Representation |
---|---|
bin | 1011011010110010… |
… | …01011001011010101 |
3 | 120211020012122122201 |
4 | 11231121023023111 |
5 | 100023323030341 |
6 | 2452145124501 |
7 | 304625355556 |
oct | 55531131325 |
9 | 16736178581 |
10 | 6130283221 |
11 | 2666426577 |
12 | 1231029731 |
13 | 76908342a |
14 | 42224432d |
15 | 25d2c0331 |
hex | 16d64b2d5 |
6130283221 has 4 divisors (see below), whose sum is σ = 6132446892. Its totient is φ = 6128119552.
The previous prime is 6130283171. The next prime is 6130283227. The reversal of 6130283221 is 1223820316.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1282642596 + 4847640625 = 35814^2 + 69625^2 .
It is a cyclic number.
It is not a de Polignac number, because 6130283221 - 213 = 6130275029 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6130283221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6130283227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1077580 + ... + 1083253.
It is an arithmetic number, because the mean of its divisors is an integer number (1533111723).
Almost surely, 26130283221 is an apocalyptic number.
It is an amenable number.
6130283221 is a deficient number, since it is larger than the sum of its proper divisors (2163671).
6130283221 is a wasteful number, since it uses less digits than its factorization.
6130283221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2163670.
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 6130283221 is about 78296.1251978666. The cubic root of 6130283221 is about 1830.1787696997.
The spelling of 6130283221 in words is "six billion, one hundred thirty million, two hundred eighty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •