Base | Representation |
---|---|
bin | 111100110101101… |
… | …100000100010101 |
3 | 2122010122021220102 |
4 | 330311230010111 |
5 | 4042300111333 |
6 | 245141143445 |
7 | 34202603300 |
oct | 7465540425 |
9 | 2563567812 |
10 | 1020707093 |
11 | 48418738a |
12 | 2459bab85 |
13 | 13360a3c3 |
14 | 997bbb37 |
15 | 5e921ae8 |
hex | 3cd6c115 |
1020707093 has 18 divisors (see below), whose sum is σ = 1197667926. Its totient is φ = 867327888.
The previous prime is 1020707071. The next prime is 1020707101. The reversal of 1020707093 is 3907070201.
It is a happy number.
1020707093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 997106929 + 23600164 = 31577^2 + 4858^2 .
It is not a de Polignac number, because 1020707093 - 214 = 1020690709 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020707033) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 2941346 + ... + 2941692.
It is an arithmetic number, because the mean of its divisors is an integer number (66537107).
Almost surely, 21020707093 is an apocalyptic number.
It is an amenable number.
1020707093 is a deficient number, since it is larger than the sum of its proper divisors (176960833).
1020707093 is an frugal number, since it uses more digits than its factorization.
1020707093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 881 (or 527 counting only the distinct ones).
The product of its (nonzero) digits is 2646, while the sum is 29.
The square root of 1020707093 is about 31948.5068978192. The cubic root of 1020707093 is about 1006.8552623250.
Adding to 1020707093 its reverse (3907070201), we get a palindrome (4927777294).
The spelling of 1020707093 in words is "one billion, twenty million, seven hundred seven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •