Base | Representation |
---|---|
bin | 1001101011101010000010… |
… | …0001010010100000111101 |
3 | 1101200201012201000002201101 |
4 | 2122322200201102200331 |
5 | 2343404213220300022 |
6 | 34350310430013101 |
7 | 2146056303215203 |
oct | 232724041224075 |
9 | 41621181002641 |
10 | 10645622040637 |
11 | 3434868124a31 |
12 | 123b239347191 |
13 | 5c2b5483b93c |
14 | 28b3724c5073 |
15 | 136db5122627 |
hex | 9aea085283d |
10645622040637 has 2 divisors, whose sum is σ = 10645622040638. Its totient is φ = 10645622040636.
The previous prime is 10645622040619. The next prime is 10645622040653. The reversal of 10645622040637 is 73604022654601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10144441581156 + 501180459481 = 3185034^2 + 707941^2 .
It is a cyclic number.
It is not a de Polignac number, because 10645622040637 - 27 = 10645622040509 is a prime.
It is a super-2 number, since 2×106456220406372 (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 (10645622040617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322811020318 + 5322811020319.
It is an arithmetic number, because the mean of its divisors is an integer number (5322811020319).
Almost surely, 210645622040637 is an apocalyptic number.
It is an amenable number.
10645622040637 is a deficient number, since it is larger than the sum of its proper divisors (1).
10645622040637 is an equidigital number, since it uses as much as digits as its factorization.
10645622040637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 46.
The spelling of 10645622040637 in words is "ten trillion, six hundred forty-five billion, six hundred twenty-two million, forty thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •