Base | Representation |
---|---|
bin | 1111011110110000… |
… | …0101101111100101 |
3 | 101201121100210210102 |
4 | 3313230011233211 |
5 | 32002303431323 |
6 | 1524203233445 |
7 | 204656265302 |
oct | 36754055745 |
9 | 11647323712 |
10 | 4155530213 |
11 | 184276339a |
12 | 97b818885 |
13 | 512c08823 |
14 | 2b5c7c0a9 |
15 | 194c48328 |
hex | f7b05be5 |
4155530213 has 4 divisors (see below), whose sum is σ = 4217553120. Its totient is φ = 4093507308.
The previous prime is 4155530189. The next prime is 4155530227. The reversal of 4155530213 is 3120355514.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 4155530213 - 214 = 4155513829 is a prime.
It is a super-3 number, since 3×41555302133 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4155536213) 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, 31011353 + ... + 31011486.
It is an arithmetic number, because the mean of its divisors is an integer number (1054388280).
Almost surely, 24155530213 is an apocalyptic number.
It is an amenable number.
4155530213 is a deficient number, since it is larger than the sum of its proper divisors (62022907).
4155530213 is an equidigital number, since it uses as much as digits as its factorization.
4155530213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62022906.
The product of its (nonzero) digits is 9000, while the sum is 29.
The square root of 4155530213 is about 64463.4021208934. The cubic root of 4155530213 is about 1607.7140781704.
Adding to 4155530213 its reverse (3120355514), we get a palindrome (7275885727).
The spelling of 4155530213 in words is "four billion, one hundred fifty-five million, five hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •