Base | Representation |
---|---|
bin | 1001100110001010100101… |
… | …1111111000110010110101 |
3 | 1101100200201002011222110211 |
4 | 2121202221133320302311 |
5 | 2340333012021400243 |
6 | 34235105341145421 |
7 | 2136206432000305 |
oct | 231425137706265 |
9 | 41320632158424 |
10 | 10551283387573 |
11 | 33a8857445655 |
12 | 1224aab55b271 |
13 | 5b6c9bbb5736 |
14 | 2869832bb605 |
15 | 1346e2e28d9d |
hex | 998a97f8cb5 |
10551283387573 has 2 divisors, whose sum is σ = 10551283387574. Its totient is φ = 10551283387572.
The previous prime is 10551283387487. The next prime is 10551283387613. The reversal of 10551283387573 is 37578338215501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10350523831729 + 200759555844 = 3217223^2 + 448062^2 .
It is an emirp because it is prime and its reverse (37578338215501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10551283387573 - 29 = 10551283387061 is a prime.
It is a super-2 number, since 2×105512833875732 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10551283387273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5275641693786 + 5275641693787.
It is an arithmetic number, because the mean of its divisors is an integer number (5275641693787).
Almost surely, 210551283387573 is an apocalyptic number.
It is an amenable number.
10551283387573 is a deficient number, since it is larger than the sum of its proper divisors (1).
10551283387573 is an equidigital number, since it uses as much as digits as its factorization.
10551283387573 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21168000, while the sum is 58.
The spelling of 10551283387573 in words is "ten trillion, five hundred fifty-one billion, two hundred eighty-three million, three hundred eighty-seven thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •