Base | Representation |
---|---|
bin | 1001101011011110111101… |
… | …1000110101000000000001 |
3 | 1101200102112121001202201001 |
4 | 2122313233120311000001 |
5 | 2343332121431132421 |
6 | 34345055510212001 |
7 | 2145622536364165 |
oct | 232675730650001 |
9 | 41612477052631 |
10 | 10642650255361 |
11 | 3433582685743 |
12 | 123a74a054001 |
13 | 5c279cc55907 |
14 | 28b16d944ca5 |
15 | 136c8e2a3691 |
hex | 9adef635001 |
10642650255361 has 2 divisors, whose sum is σ = 10642650255362. Its totient is φ = 10642650255360.
The previous prime is 10642650255317. The next prime is 10642650255379. The reversal of 10642650255361 is 16355205624601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8249998142961 + 2392652112400 = 2872281^2 + 1546820^2 .
It is a cyclic number.
It is not a de Polignac number, because 10642650255361 - 27 = 10642650255233 is a prime.
It is a super-2 number, since 2×106426502553612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10642650255961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5321325127680 + 5321325127681.
It is an arithmetic number, because the mean of its divisors is an integer number (5321325127681).
Almost surely, 210642650255361 is an apocalyptic number.
It is an amenable number.
10642650255361 is a deficient number, since it is larger than the sum of its proper divisors (1).
10642650255361 is an equidigital number, since it uses as much as digits as its factorization.
10642650255361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296000, while the sum is 46.
Adding to 10642650255361 its reverse (16355205624601), we get a palindrome (26997855879962).
The spelling of 10642650255361 in words is "ten trillion, six hundred forty-two billion, six hundred fifty million, two hundred fifty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •