Base | Representation |
---|---|
bin | 111111011000001… |
… | …100001101000011 |
3 | 2202002210112200121 |
4 | 333120030031003 |
5 | 4134201243201 |
6 | 253302201111 |
7 | 35230644433 |
oct | 7730141503 |
9 | 2662715617 |
10 | 1063306051 |
11 | 4a6232635 |
12 | 258123197 |
13 | 13c3a3ba2 |
14 | a130a2c3 |
15 | 635389a1 |
hex | 3f60c343 |
1063306051 has 8 divisors (see below), whose sum is σ = 1098135360. Its totient is φ = 1028985408.
The previous prime is 1063306043. The next prime is 1063306099. The reversal of 1063306051 is 1506033601.
1063306051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1063306051 - 23 = 1063306043 is a prime.
It is a super-2 number, since 2×10633060512 = 2261239516186429202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1063306001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 122916 + ... + 131281.
It is an arithmetic number, because the mean of its divisors is an integer number (137266920).
Almost surely, 21063306051 is an apocalyptic number.
1063306051 is a deficient number, since it is larger than the sum of its proper divisors (34829309).
1063306051 is an equidigital number, since it uses as much as digits as its factorization.
1063306051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254333.
The product of its (nonzero) digits is 1620, while the sum is 25.
The square root of 1063306051 is about 32608.3739398333. The cubic root of 1063306051 is about 1020.6717512088.
Adding to 1063306051 its reverse (1506033601), we get a palindrome (2569339652).
The spelling of 1063306051 in words is "one billion, sixty-three million, three hundred six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •