Base | Representation |
---|---|
bin | 1001011100001011110000… |
… | …0111101100010001111101 |
3 | 1100202022001220111222201000 |
4 | 2113002330013230101331 |
5 | 2330030311030321000 |
6 | 34024225111240513 |
7 | 2120626022531016 |
oct | 227027407542175 |
9 | 40668056458630 |
10 | 10379797120125 |
11 | 3342057967784 |
12 | 11b7811079139 |
13 | 5a3a70066b74 |
14 | 27c5560b800d |
15 | 130007d98000 |
hex | 970bc1ec47d |
10379797120125 has 128 divisors (see below), whose sum is σ = 19856876083200. Its totient is φ = 5343916032000.
The previous prime is 10379797120117. The next prime is 10379797120157. The reversal of 10379797120125 is 52102179797301.
10379797120125 is a `hidden beast` number, since 10 + 379 + 79 + 71 + 2 + 0 + 125 = 666.
It is not a de Polignac number, because 10379797120125 - 23 = 10379797120117 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 751770972 + ... + 751784778.
It is an arithmetic number, because the mean of its divisors is an integer number (155131844400).
Almost surely, 210379797120125 is an apocalyptic number.
10379797120125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10379797120125 is a deficient number, since it is larger than the sum of its proper divisors (9477078963075).
10379797120125 is a wasteful number, since it uses less digits than its factorization.
10379797120125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21541 (or 21525 counting only the distinct ones).
The product of its (nonzero) digits is 1666980, while the sum is 54.
The spelling of 10379797120125 in words is "ten trillion, three hundred seventy-nine billion, seven hundred ninety-seven million, one hundred twenty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •