Base | Representation |
---|---|
bin | 100000000000001… |
… | …1010111011000101 |
3 | 2202211122100011001 |
4 | 1000000122323011 |
5 | 4144401231401 |
6 | 254320213301 |
7 | 35416410100 |
oct | 10000327305 |
9 | 2684570131 |
10 | 1073852101 |
11 | 501185a83 |
12 | 25b76a231 |
13 | 14162715a |
14 | a2893737 |
15 | 6441d601 |
hex | 4001aec5 |
1073852101 has 12 divisors (see below), whose sum is σ = 1249709952. Its totient is φ = 920050488.
The previous prime is 1073852093. The next prime is 1073852111. The reversal of 1073852101 is 1012583701.
It is not a de Polignac number, because 1073852101 - 23 = 1073852093 is a prime.
It is a super-2 number, since 2×10738521012 = 2306316669644228402, which contains 22 as substring.
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 1073852101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1073852111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 211276 + ... + 216298.
It is an arithmetic number, because the mean of its divisors is an integer number (104142496).
Almost surely, 21073852101 is an apocalyptic number.
It is an amenable number.
1073852101 is a deficient number, since it is larger than the sum of its proper divisors (175857851).
1073852101 is an equidigital number, since it uses as much as digits as its factorization.
1073852101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9400 (or 9393 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 28.
The square root of 1073852101 is about 32769.6826502791. The cubic root of 1073852101 is about 1024.0350549141.
The spelling of 1073852101 in words is "one billion, seventy-three million, eight hundred fifty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •