Base | Representation |
---|---|
bin | 111101101100011… |
… | …010010100010001 |
3 | 2200010122002211120 |
4 | 331230122110101 |
5 | 4104433133210 |
6 | 250412432453 |
7 | 34435541130 |
oct | 7554322421 |
9 | 2603562746 |
10 | 1035052305 |
11 | 491295131 |
12 | 24a778729 |
13 | 1365909b1 |
14 | 9b673917 |
15 | 60d07270 |
hex | 3db1a511 |
1035052305 has 16 divisors (see below), whose sum is σ = 1892667264. Its totient is φ = 473166720.
The previous prime is 1035052297. The next prime is 1035052313. The reversal of 1035052305 is 5032505301.
1035052305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1035052297) and next prime (1035052313).
It is not a de Polignac number, because 1035052305 - 23 = 1035052297 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4928716 + ... + 4928925.
It is an arithmetic number, because the mean of its divisors is an integer number (118291704).
Almost surely, 21035052305 is an apocalyptic number.
1035052305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1035052305 is a deficient number, since it is larger than the sum of its proper divisors (857614959).
1035052305 is an equidigital number, since it uses as much as digits as its factorization.
1035052305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9857656.
The product of its (nonzero) digits is 2250, while the sum is 24.
The square root of 1035052305 is about 32172.2287850873. The cubic root of 1035052305 is about 1011.5501813535.
Adding to 1035052305 its reverse (5032505301), we get a palindrome (6067557606).
The spelling of 1035052305 in words is "one billion, thirty-five million, fifty-two thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •