Base | Representation |
---|---|
bin | 111101101101110… |
… | …010011101110001 |
3 | 2200011022110010000 |
4 | 331231302131301 |
5 | 4110031211421 |
6 | 250424300213 |
7 | 34441603563 |
oct | 7555623561 |
9 | 2604273100 |
10 | 1035413361 |
11 | 491511424 |
12 | 24a911669 |
13 | 136689138 |
14 | 9b729333 |
15 | 60d79226 |
hex | 3db72771 |
1035413361 has 80 divisors (see below), whose sum is σ = 1686643200. Its totient is φ = 631411200.
The previous prime is 1035413293. The next prime is 1035413369. The reversal of 1035413361 is 1633145301.
It is not a de Polignac number, because 1035413361 - 29 = 1035412849 is a prime.
It is a super-3 number, since 3×10354133613 (a number of 28 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1035413369) 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 79 ways as a sum of consecutive naturals, for example, 4296201 + ... + 4296441.
It is an arithmetic number, because the mean of its divisors is an integer number (21083040).
Almost surely, 21035413361 is an apocalyptic number.
It is an amenable number.
1035413361 is a deficient number, since it is larger than the sum of its proper divisors (651229839).
1035413361 is a wasteful number, since it uses less digits than its factorization.
1035413361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372 (or 363 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 1035413361 is about 32177.8395949759. The cubic root of 1035413361 is about 1011.6677869411.
Adding to 1035413361 its reverse (1633145301), we get a palindrome (2668558662).
The spelling of 1035413361 in words is "one billion, thirty-five million, four hundred thirteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •