Base | Representation |
---|---|
bin | 10100100110000000… |
… | …11110100101111101 |
3 | 1001112112101202221011 |
4 | 22103000132211331 |
5 | 140120403420103 |
6 | 5025035035221 |
7 | 540662042563 |
oct | 122300364575 |
9 | 31475352834 |
10 | 11056310653 |
11 | 4763aa9923 |
12 | 218689bb11 |
13 | 10727b226b |
14 | 76c56ba33 |
15 | 44a9b3d6d |
hex | 29301e97d |
11056310653 has 8 divisors (see below), whose sum is σ = 11667545120. Its totient is φ = 10448008560.
The previous prime is 11056310599. The next prime is 11056310663. The reversal of 11056310653 is 35601365011.
11056310653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11056310653 - 217 = 11056179581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11056310663) 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 7 ways as a sum of consecutive naturals, for example, 725343 + ... + 740428.
It is an arithmetic number, because the mean of its divisors is an integer number (1458443140).
Almost surely, 211056310653 is an apocalyptic number.
It is an amenable number.
11056310653 is a deficient number, since it is larger than the sum of its proper divisors (611234467).
11056310653 is a wasteful number, since it uses less digits than its factorization.
11056310653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1466187.
The product of its (nonzero) digits is 8100, while the sum is 31.
Adding to 11056310653 its reverse (35601365011), we get a palindrome (46657675664).
The spelling of 11056310653 in words is "eleven billion, fifty-six million, three hundred ten thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •