Base | Representation |
---|---|
bin | 1001010100000111010000… |
… | …1110111011101110111101 |
3 | 1100021001012111110111022211 |
4 | 2111001310032323232331 |
5 | 2320242334414333110 |
6 | 33440415331340421 |
7 | 2104620203412064 |
oct | 225016416735675 |
9 | 40231174414284 |
10 | 10241152105405 |
11 | 3299280417091 |
12 | 1194979151711 |
13 | 593976122410 |
14 | 2759628011db |
15 | 12b5e10c898a |
hex | 950743bbbbd |
10241152105405 has 8 divisors (see below), whose sum is σ = 13234719643992. Its totient is φ = 7562696939328.
The previous prime is 10241152105339. The next prime is 10241152105439. The reversal of 10241152105405 is 50450125114201.
It can be written as a sum of positive squares in 4 ways, for example, as 19505474244 + 10221646631161 = 139662^2 + 3197131^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10241152105405 - 27 = 10241152105277 is a prime.
It is a Duffinian number.
It is a congruent number.
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, 78778093054 + ... + 78778093183.
It is an arithmetic number, because the mean of its divisors is an integer number (1654339955499).
Almost surely, 210241152105405 is an apocalyptic number.
It is an amenable number.
10241152105405 is a deficient number, since it is larger than the sum of its proper divisors (2993567538587).
10241152105405 is a wasteful number, since it uses less digits than its factorization.
10241152105405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157556186255.
The product of its (nonzero) digits is 8000, while the sum is 31.
Adding to 10241152105405 its reverse (50450125114201), we get a palindrome (60691277219606).
The spelling of 10241152105405 in words is "ten trillion, two hundred forty-one billion, one hundred fifty-two million, one hundred five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •