Base | Representation |
---|---|
bin | 10101100110111001… |
… | …10010000111001111 |
3 | 1002221110120121200022 |
4 | 22303130302013033 |
5 | 142224223222201 |
6 | 5155041052355 |
7 | 560321325530 |
oct | 126334620717 |
9 | 32843517608 |
10 | 11600601551 |
11 | 4a13267710 |
12 | 22b90270bb |
13 | 112b4a3c96 |
14 | 7c0972687 |
15 | 47d67a41b |
hex | 2b37321cf |
11600601551 has 16 divisors (see below), whose sum is σ = 14466193920. Its totient is φ = 9037488480.
The previous prime is 11600601511. The next prime is 11600601557. The reversal of 11600601551 is 15510600611.
It is a cyclic number.
It is not a de Polignac number, because 11600601551 - 210 = 11600600527 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11600601551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11600601557) 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 15 ways as a sum of consecutive naturals, for example, 420845 + ... + 447561.
It is an arithmetic number, because the mean of its divisors is an integer number (904137120).
Almost surely, 211600601551 is an apocalyptic number.
11600601551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11600601551 is a deficient number, since it is larger than the sum of its proper divisors (2865592369).
11600601551 is a wasteful number, since it uses less digits than its factorization.
11600601551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32374.
The product of its (nonzero) digits is 900, while the sum is 26.
It can be divided in two parts, 1160060 and 1551, that added together give a palindrome (1161611).
The spelling of 11600601551 in words is "eleven billion, six hundred million, six hundred one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •