Base | Representation |
---|---|
bin | 1001011100100011110101… |
… | …1000000010011010110101 |
3 | 1100202220202100202110212201 |
4 | 2113020331120002122311 |
5 | 2330132030210231034 |
6 | 34031214322544501 |
7 | 2121245135506453 |
oct | 227107530023265 |
9 | 40686670673781 |
10 | 10386260633269 |
11 | 33448743a3884 |
12 | 11b8b15808131 |
13 | 5a4560181261 |
14 | 27c9aa6a19d3 |
15 | 13028553d014 |
hex | 9723d6026b5 |
10386260633269 has 2 divisors, whose sum is σ = 10386260633270. Its totient is φ = 10386260633268.
The previous prime is 10386260633267. The next prime is 10386260633303. The reversal of 10386260633269 is 96233606268301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10126301374225 + 259959259044 = 3182185^2 + 509862^2 .
It is a cyclic number.
It is not a de Polignac number, because 10386260633269 - 21 = 10386260633267 is a prime.
It is a super-2 number, since 2×103862606332692 (a number of 27 digits) contains 22 as substring.
Together with 10386260633267, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10386260633261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5193130316634 + 5193130316635.
It is an arithmetic number, because the mean of its divisors is an integer number (5193130316635).
Almost surely, 210386260633269 is an apocalyptic number.
It is an amenable number.
10386260633269 is a deficient number, since it is larger than the sum of its proper divisors (1).
10386260633269 is an equidigital number, since it uses as much as digits as its factorization.
10386260633269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10077696, while the sum is 55.
The spelling of 10386260633269 in words is "ten trillion, three hundred eighty-six billion, two hundred sixty million, six hundred thirty-three thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •