Base | Representation |
---|---|
bin | 111100110011000… |
… | …111000010000001 |
3 | 2122002100221121211 |
4 | 330303013002001 |
5 | 4042111443410 |
6 | 245114450121 |
7 | 34164056422 |
oct | 7463070201 |
9 | 2562327554 |
10 | 1020031105 |
11 | 483865515 |
12 | 245733941 |
13 | 133431802 |
14 | 99683649 |
15 | 5e83b68a |
hex | 3ccc7081 |
1020031105 has 4 divisors (see below), whose sum is σ = 1224037332. Its totient is φ = 816024880.
The previous prime is 1020031091. The next prime is 1020031109. The reversal of 1020031105 is 5011300201.
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 780029041 + 240002064 = 27929^2 + 15492^2 .
It is not a de Polignac number, because 1020031105 - 227 = 885813377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020031109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 102003106 + ... + 102003115.
It is an arithmetic number, because the mean of its divisors is an integer number (306009333).
Almost surely, 21020031105 is an apocalyptic number.
It is an amenable number.
1020031105 is a deficient number, since it is larger than the sum of its proper divisors (204006227).
1020031105 is an equidigital number, since it uses as much as digits as its factorization.
1020031105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204006226.
The product of its (nonzero) digits is 30, while the sum is 13.
The square root of 1020031105 is about 31937.9258092945. The cubic root of 1020031105 is about 1006.6329418088.
Adding to 1020031105 its reverse (5011300201), we get a palindrome (6031331306).
The spelling of 1020031105 in words is "one billion, twenty million, thirty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •