Base | Representation |
---|---|
bin | 1001100110001110001111… |
… | …1011010101111001110111 |
3 | 1101100210020101202010212101 |
4 | 2121203203323111321313 |
5 | 2340342013444210343 |
6 | 34235350520002531 |
7 | 2136242634130642 |
oct | 231434373257167 |
9 | 41323211663771 |
10 | 10552263663223 |
11 | 33a920a817217 |
12 | 1225123900447 |
13 | 5b70c7007ab9 |
14 | 286a37572a59 |
15 | 13474e010e4d |
hex | 998e3ed5e77 |
10552263663223 has 8 divisors (see below), whose sum is σ = 10553906666592. Its totient is φ = 10550620808736.
The previous prime is 10552263663217. The next prime is 10552263663239. The reversal of 10552263663223 is 32236636225501.
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 10552263663223 - 221 = 10552261566071 is a prime.
It is a super-2 number, since 2×105522636632232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10552263663923) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 264600361 + ... + 264640237.
It is an arithmetic number, because the mean of its divisors is an integer number (1319238333324).
Almost surely, 210552263663223 is an apocalyptic number.
10552263663223 is a deficient number, since it is larger than the sum of its proper divisors (1643003369).
10552263663223 is a wasteful number, since it uses less digits than its factorization.
10552263663223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74441.
The product of its (nonzero) digits is 2332800, while the sum is 46.
Adding to 10552263663223 its reverse (32236636225501), we get a palindrome (42788899888724).
The spelling of 10552263663223 in words is "ten trillion, five hundred fifty-two billion, two hundred sixty-three million, six hundred sixty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •