Base | Representation |
---|---|
bin | 1001001001111011110000… |
… | …0000011111100101111111 |
3 | 1022122022210011001010220121 |
4 | 2102132330000133211333 |
5 | 2304411201212324133 |
6 | 33224213250555411 |
7 | 2056156241335033 |
oct | 222367400374577 |
9 | 38568704033817 |
10 | 10066262620543 |
11 | 3231094905638 |
12 | 1166aaab98b67 |
13 | 5803241c242c |
14 | 26b2d16341c3 |
15 | 126ca73a702d |
hex | 927bc01f97f |
10066262620543 has 2 divisors, whose sum is σ = 10066262620544. Its totient is φ = 10066262620542.
The previous prime is 10066262620529. The next prime is 10066262620549. The reversal of 10066262620543 is 34502626266001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10066262620543 - 217 = 10066262489471 is a prime.
It is a super-2 number, since 2×100662626205432 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10066262620543.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10066262620549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5033131310271 + 5033131310272.
It is an arithmetic number, because the mean of its divisors is an integer number (5033131310272).
Almost surely, 210066262620543 is an apocalyptic number.
10066262620543 is a deficient number, since it is larger than the sum of its proper divisors (1).
10066262620543 is an equidigital number, since it uses as much as digits as its factorization.
10066262620543 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 622080, while the sum is 43.
Adding to 10066262620543 its reverse (34502626266001), we get a palindrome (44568888886544).
The spelling of 10066262620543 in words is "ten trillion, sixty-six billion, two hundred sixty-two million, six hundred twenty thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •