Base | Representation |
---|---|
bin | 10000110011101101010… |
… | …010010001011010000111 |
3 | 11002102100011220110212200 |
4 | 100303231102101122013 |
5 | 122411001222203130 |
6 | 2242340421045543 |
7 | 146306526632265 |
oct | 20635522213207 |
9 | 4072304813780 |
10 | 1155032225415 |
11 | 405934641522 |
12 | 167a29b568b3 |
13 | 84bc427a773 |
14 | 3dc92287435 |
15 | 200a2015760 |
hex | 10ced491687 |
1155032225415 has 48 divisors (see below), whose sum is σ = 2035469498400. Its totient is φ = 605741955840.
The previous prime is 1155032225351. The next prime is 1155032225483. The reversal of 1155032225415 is 5145222305511.
1155032225415 is a `hidden beast` number, since 1 + 1 + 550 + 32 + 22 + 54 + 1 + 5 = 666.
It is not a de Polignac number, because 1155032225415 - 26 = 1155032225351 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1155032225415.
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 47 ways as a sum of consecutive naturals, for example, 9638536 + ... + 9757634.
It is an arithmetic number, because the mean of its divisors is an integer number (42405614550).
Almost surely, 21155032225415 is an apocalyptic number.
1155032225415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1155032225415 is a deficient number, since it is larger than the sum of its proper divisors (880437272985).
1155032225415 is a wasteful number, since it uses less digits than its factorization.
1155032225415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122704 (or 122701 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 36.
The spelling of 1155032225415 in words is "one trillion, one hundred fifty-five billion, thirty-two million, two hundred twenty-five thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •