Base | Representation |
---|---|
bin | 1001101011101001010110… |
… | …1101001111001011011001 |
3 | 1101200200202001122010221112 |
4 | 2122322111231033023121 |
5 | 2343403330244421241 |
6 | 34350240425350105 |
7 | 2146051641204560 |
oct | 232722555171331 |
9 | 41620661563845 |
10 | 10645440623321 |
11 | 3434784784469 |
12 | 123b1a8638335 |
13 | 5c2b2608c90a |
14 | 28b35637cbd7 |
15 | 136da42391eb |
hex | 9ae95b4f2d9 |
10645440623321 has 4 divisors (see below), whose sum is σ = 12166217855232. Its totient is φ = 9124663391412.
The previous prime is 10645440623297. The next prime is 10645440623347. The reversal of 10645440623321 is 12332604454601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10645440623321 is a prime.
It is a super-2 number, since 2×106454406233212 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10645440623371) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 760388615945 + ... + 760388615958.
It is an arithmetic number, because the mean of its divisors is an integer number (3041554463808).
Almost surely, 210645440623321 is an apocalyptic number.
It is an amenable number.
10645440623321 is a deficient number, since it is larger than the sum of its proper divisors (1520777231911).
10645440623321 is an equidigital number, since it uses as much as digits as its factorization.
10645440623321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1520777231910.
The product of its (nonzero) digits is 414720, while the sum is 41.
The spelling of 10645440623321 in words is "ten trillion, six hundred forty-five billion, four hundred forty million, six hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •