Base | Representation |
---|---|
bin | 1001101100100111110011… |
… | …1000111100100011010111 |
3 | 1101202022000100010121010102 |
4 | 2123021330320330203113 |
5 | 2344142143224202133 |
6 | 34402052101444315 |
7 | 2150214233524436 |
oct | 233117470744327 |
9 | 41668010117112 |
10 | 10662204131543 |
11 | 34408a72a6298 |
12 | 12424a671069b |
13 | 5c459808cc53 |
14 | 28c0a689b11d |
15 | 137535c997e8 |
hex | 9b27ce3c8d7 |
10662204131543 has 4 divisors (see below), whose sum is σ = 10672253335368. Its totient is φ = 10652154927720.
The previous prime is 10662204131521. The next prime is 10662204131561. The reversal of 10662204131543 is 34513140226601.
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 10662204131543 - 214 = 10662204115159 is a prime.
It is a super-2 number, since 2×106622041315432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10662204131497 and 10662204131506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10662204131573) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5024600321 + ... + 5024602442.
It is an arithmetic number, because the mean of its divisors is an integer number (2668063333842).
Almost surely, 210662204131543 is an apocalyptic number.
10662204131543 is a deficient number, since it is larger than the sum of its proper divisors (10049203825).
10662204131543 is a wasteful number, since it uses less digits than its factorization.
10662204131543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10049203824.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 10662204131543 in words is "ten trillion, six hundred sixty-two billion, two hundred four million, one hundred thirty-one thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •