Base | Representation |
---|---|
bin | 111101101100010… |
… | …100111100101111 |
3 | 2200010120222200021 |
4 | 331230110330233 |
5 | 4104431432234 |
6 | 250412143011 |
7 | 34435420051 |
oct | 7554247457 |
9 | 2603528607 |
10 | 1035030319 |
11 | 49127a664 |
12 | 24a767a67 |
13 | 13658399b |
14 | 9b6698d1 |
15 | 60d009b4 |
hex | 3db14f2f |
1035030319 has 4 divisors (see below), whose sum is σ = 1044526120. Its totient is φ = 1025534520.
The previous prime is 1035030289. The next prime is 1035030343. The reversal of 1035030319 is 9130305301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1035030319 - 211 = 1035028271 is a prime.
It is a super-2 number, since 2×10350303192 = 2142575522498483522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1035030293 and 1035030302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1035030389) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4747737 + ... + 4747954.
It is an arithmetic number, because the mean of its divisors is an integer number (261131530).
Almost surely, 21035030319 is an apocalyptic number.
1035030319 is a deficient number, since it is larger than the sum of its proper divisors (9495801).
1035030319 is an equidigital number, since it uses as much as digits as its factorization.
1035030319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9495800.
The product of its (nonzero) digits is 1215, while the sum is 25.
The square root of 1035030319 is about 32171.8870910614. The cubic root of 1035030319 is about 1011.5430190425.
The spelling of 1035030319 in words is "one billion, thirty-five million, thirty thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •