Base | Representation |
---|---|
bin | 10000110011110010010… |
… | …010000010110001101010 |
3 | 11002102120000122021201210 |
4 | 100303302102002301222 |
5 | 122411134202122222 |
6 | 2242353013453550 |
7 | 146311565302344 |
oct | 20636222026152 |
9 | 4072500567653 |
10 | 1155116051562 |
11 | 405977996330 |
12 | 167a520412b6 |
13 | 84c0874a535 |
14 | 3dc9d468294 |
15 | 200a9572d0c |
hex | 10cf2482c6a |
1155116051562 has 32 divisors (see below), whose sum is σ = 2538649232064. Its totient is φ = 347480163200.
The previous prime is 1155116051543. The next prime is 1155116051567. The reversal of 1155116051562 is 2651506115511.
It is a self number, because there is not a number n which added to its sum of digits gives 1155116051562.
It is not an unprimeable number, because it can be changed into a prime (1155116051567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63865989 + ... + 63884072.
It is an arithmetic number, because the mean of its divisors is an integer number (79332788502).
Almost surely, 21155116051562 is an apocalyptic number.
1155116051562 is an abundant number, since it is smaller than the sum of its proper divisors (1383533180502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1155116051562 is a wasteful number, since it uses less digits than its factorization.
1155116051562 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127750214.
The product of its (nonzero) digits is 45000, while the sum is 39.
The spelling of 1155116051562 in words is "one trillion, one hundred fifty-five billion, one hundred sixteen million, fifty-one thousand, five hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.981 sec. • engine limits •