Base | Representation |
---|---|
bin | 111110001001000… |
… | …011100101010101 |
3 | 2200122202121022220 |
4 | 332021003211111 |
5 | 4113343430430 |
6 | 251241412553 |
7 | 34556424336 |
oct | 7611034525 |
9 | 2618677286 |
10 | 1042561365 |
11 | 49555386a |
12 | 25119a159 |
13 | 137cbc821 |
14 | 9c66a28d |
15 | 617dc110 |
hex | 3e243955 |
1042561365 has 32 divisors (see below), whose sum is σ = 1757583360. Its totient is φ = 526675776.
The previous prime is 1042561361. The next prime is 1042561393. The reversal of 1042561365 is 5631652401.
1042561365 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1042561365 - 22 = 1042561361 is a prime.
It is a super-3 number, since 3×10425613653 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042561361) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20866 + ... + 50204.
It is an arithmetic number, because the mean of its divisors is an integer number (54924480).
Almost surely, 21042561365 is an apocalyptic number.
1042561365 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1042561365 is a deficient number, since it is larger than the sum of its proper divisors (715021995).
1042561365 is a wasteful number, since it uses less digits than its factorization.
1042561365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29473.
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 1042561365 is about 32288.7188503973. The cubic root of 1042561365 is about 1013.9904754619.
The spelling of 1042561365 in words is "one billion, forty-two million, five hundred sixty-one thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •