Base | Representation |
---|---|
bin | 111110111010001… |
… | …001111010101101 |
3 | 2201112222112000121 |
4 | 332322021322231 |
5 | 4130142313430 |
6 | 252421324541 |
7 | 35104012201 |
oct | 7672117255 |
9 | 2645875017 |
10 | 1055432365 |
11 | 4a1844a59 |
12 | 255566751 |
13 | 13a8780c0 |
14 | a025ab01 |
15 | 629d0a7a |
hex | 3ee89ead |
1055432365 has 16 divisors (see below), whose sum is σ = 1369670400. Its totient is φ = 776123712.
The previous prime is 1055432359. The next prime is 1055432381. The reversal of 1055432365 is 5632345501.
It is not a de Polignac number, because 1055432365 - 27 = 1055432237 is a prime.
It is a super-3 number, since 3×10554323653 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1055432365.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 18435 + ... + 49504.
It is an arithmetic number, because the mean of its divisors is an integer number (85604400).
Almost surely, 21055432365 is an apocalyptic number.
It is an amenable number.
1055432365 is a deficient number, since it is larger than the sum of its proper divisors (314238035).
1055432365 is a wasteful number, since it uses less digits than its factorization.
1055432365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68196.
The product of its (nonzero) digits is 54000, while the sum is 34.
The square root of 1055432365 is about 32487.4185647306. The cubic root of 1055432365 is about 1018.1461794245.
Adding to 1055432365 its reverse (5632345501), we get a palindrome (6687777866).
The spelling of 1055432365 in words is "one billion, fifty-five million, four hundred thirty-two thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •