Base | Representation |
---|---|
bin | 1010000010111100010011… |
… | …1001001010000010000011 |
3 | 1110002221210022222012101111 |
4 | 2200233010321022002003 |
5 | 2421433010021020101 |
6 | 35254150314344151 |
7 | 2220010566605563 |
oct | 240570471120203 |
9 | 43087708865344 |
10 | 11045664235651 |
11 | 3579492557041 |
12 | 12a488272b057 |
13 | 6217a8b31936 |
14 | 2a288210cda3 |
15 | 1424ca5a3251 |
hex | a0bc4e4a083 |
11045664235651 has 4 divisors (see below), whose sum is σ = 11302540148152. Its totient is φ = 10788788323152.
The previous prime is 11045664235649. The next prime is 11045664235681. The reversal of 11045664235651 is 15653246654011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11045664235651 - 21 = 11045664235649 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11045664235595 and 11045664235604.
It is not an unprimeable number, because it can be changed into a prime (11045664235601) 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 3 ways as a sum of consecutive naturals, for example, 128437956186 + ... + 128437956271.
It is an arithmetic number, because the mean of its divisors is an integer number (2825635037038).
Almost surely, 211045664235651 is an apocalyptic number.
11045664235651 is a deficient number, since it is larger than the sum of its proper divisors (256875912501).
11045664235651 is an equidigital number, since it uses as much as digits as its factorization.
11045664235651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256875912500.
The product of its (nonzero) digits is 2592000, while the sum is 49.
The spelling of 11045664235651 in words is "eleven trillion, forty-five billion, six hundred sixty-four million, two hundred thirty-five thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •