Base | Representation |
---|---|
bin | 1001101011101000111100… |
… | …1000000001101010101011 |
3 | 1101200200110100212022222020 |
4 | 2122322033020001222223 |
5 | 2343403114013032410 |
6 | 34350221442555523 |
7 | 2146046130522366 |
oct | 232721710015253 |
9 | 41620410768866 |
10 | 10645330205355 |
11 | 343472841784a |
12 | 123b177668ba3 |
13 | 5c2b0923c241 |
14 | 28b3458390dd |
15 | 136d996c7a70 |
hex | 9ae8f201aab |
10645330205355 has 8 divisors (see below), whose sum is σ = 17032528328592. Its totient is φ = 5677509442848.
The previous prime is 10645330205333. The next prime is 10645330205369. The reversal of 10645330205355 is 55350203354601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10645330205355 - 26 = 10645330205291 is a prime.
It is a super-2 number, since 2×106453302053552 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 354844340164 + ... + 354844340193.
It is an arithmetic number, because the mean of its divisors is an integer number (2129066041074).
Almost surely, 210645330205355 is an apocalyptic number.
10645330205355 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10645330205355 is a deficient number, since it is larger than the sum of its proper divisors (6387198123237).
10645330205355 is an equidigital number, since it uses as much as digits as its factorization.
10645330205355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709688680365.
The product of its (nonzero) digits is 810000, while the sum is 42.
Adding to 10645330205355 its reverse (55350203354601), we get a palindrome (65995533559956).
The spelling of 10645330205355 in words is "ten trillion, six hundred forty-five billion, three hundred thirty million, two hundred five thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •