Base | Representation |
---|---|
bin | 1001010100000111000101… |
… | …0001100100101001000101 |
3 | 1100021001002001001112022201 |
4 | 2111001301101210221011 |
5 | 2320242234212344410 |
6 | 33440410355354501 |
7 | 2104616031444454 |
oct | 225016121445105 |
9 | 40231061045281 |
10 | 10241102465605 |
11 | 32992553a1a60 |
12 | 11949645b2a31 |
13 | 593968a61c5b |
14 | 275959d9cb9b |
15 | 12b5dba7083a |
hex | 95071464a45 |
10241102465605 has 8 divisors (see below), whose sum is σ = 13406534136864. Its totient is φ = 7448074520400.
The previous prime is 10241102465549. The next prime is 10241102465611. The reversal of 10241102465605 is 50656420114201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10241102465605 - 213 = 10241102457413 is a prime.
It is a super-2 number, since 2×102411024656052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93100931451 + ... + 93100931560.
It is an arithmetic number, because the mean of its divisors is an integer number (1675816767108).
Almost surely, 210241102465605 is an apocalyptic number.
It is an amenable number.
10241102465605 is a deficient number, since it is larger than the sum of its proper divisors (3165431671259).
10241102465605 is a wasteful number, since it uses less digits than its factorization.
10241102465605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186201863027.
The product of its (nonzero) digits is 57600, while the sum is 37.
Adding to 10241102465605 its reverse (50656420114201), we get a palindrome (60897522579806).
The spelling of 10241102465605 in words is "ten trillion, two hundred forty-one billion, one hundred two million, four hundred sixty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •