Base | Representation |
---|---|
bin | 1111011101000111… |
… | …1011101001100001 |
3 | 101201010110102122001 |
4 | 3313101323221201 |
5 | 31444030014441 |
6 | 1523400244001 |
7 | 204544065625 |
oct | 36721735141 |
9 | 11633412561 |
10 | 4148673121 |
11 | 18398aa57a |
12 | 979470601 |
13 | 511677688 |
14 | 2b4db5185 |
15 | 194341731 |
hex | f747ba61 |
4148673121 has 4 divisors (see below), whose sum is σ = 4150206144. Its totient is φ = 4147140100.
The previous prime is 4148673119. The next prime is 4148673143. The reversal of 4148673121 is 1213768414.
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 a cyclic number.
It is not a de Polignac number, because 4148673121 - 21 = 4148673119 is a prime.
It is a super-2 number, since 2×41486731212 = 34422977329815761282, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4148673101) 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 3 ways as a sum of consecutive naturals, for example, 762445 + ... + 767866.
It is an arithmetic number, because the mean of its divisors is an integer number (1037551536).
Almost surely, 24148673121 is an apocalyptic number.
It is an amenable number.
4148673121 is a deficient number, since it is larger than the sum of its proper divisors (1533023).
4148673121 is a wasteful number, since it uses less digits than its factorization.
4148673121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1533022.
The product of its digits is 32256, while the sum is 37.
The square root of 4148673121 is about 64410.1942319692. The cubic root of 4148673121 is about 1606.8292883369.
The spelling of 4148673121 in words is "four billion, one hundred forty-eight million, six hundred seventy-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •