Base | Representation |
---|---|
bin | 111100110100001… |
… | …100001110110001 |
3 | 2122002220100102121 |
4 | 330310030032301 |
5 | 4042200031140 |
6 | 245124514241 |
7 | 34166346655 |
oct | 7464141661 |
9 | 2562810377 |
10 | 1020314545 |
11 | 483a39468 |
12 | 24584b981 |
13 | 133500823 |
14 | 99718a65 |
15 | 5e89564a |
hex | 3cd0c3b1 |
1020314545 has 8 divisors (see below), whose sum is σ = 1225390824. Its totient is φ = 815576064.
The previous prime is 1020314531. The next prime is 1020314597. The reversal of 1020314545 is 5454130201.
It is a happy number.
1020314545 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 4 ways, for example, as 4490161 + 1015824384 = 2119^2 + 31872^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020314545 - 25 = 1020314513 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77754 + ... + 89923.
It is an arithmetic number, because the mean of its divisors is an integer number (153173853).
Almost surely, 21020314545 is an apocalyptic number.
It is an amenable number.
1020314545 is a deficient number, since it is larger than the sum of its proper divisors (205076279).
1020314545 is a wasteful number, since it uses less digits than its factorization.
1020314545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168899.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 1020314545 is about 31942.3628587492. The cubic root of 1020314545 is about 1006.7261721741.
Adding to 1020314545 its reverse (5454130201), we get a palindrome (6474444746).
The spelling of 1020314545 in words is "one billion, twenty million, three hundred fourteen thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •