Base | Representation |
---|---|
bin | 1001010000001100110000… |
… | …1110100010010001000001 |
3 | 1100000121122012112201020211 |
4 | 2110003030032202101001 |
5 | 2313142131140404421 |
6 | 33345455040434121 |
7 | 2100016642642645 |
oct | 224031416422101 |
9 | 40017565481224 |
10 | 10173908919361 |
11 | 3272804396160 |
12 | 1183931618941 |
13 | 58a51ab94235 |
14 | 2725c3daac25 |
15 | 1299a7a219e1 |
hex | 940cc3a2441 |
10173908919361 has 8 divisors (see below), whose sum is σ = 11109369980448. Its totient is φ = 9240207900000.
The previous prime is 10173908919337. The next prime is 10173908919371. The reversal of 10173908919361 is 16391980937101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10173908919361 - 229 = 10173372048449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10173908919296 and 10173908919305.
It is not an unprimeable number, because it can be changed into a prime (10173908919371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 439998340 + ... + 440021461.
It is an arithmetic number, because the mean of its divisors is an integer number (1388671247556).
Almost surely, 210173908919361 is an apocalyptic number.
10173908919361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10173908919361 is a deficient number, since it is larger than the sum of its proper divisors (935461061087).
10173908919361 is a wasteful number, since it uses less digits than its factorization.
10173908919361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880020863.
The product of its (nonzero) digits is 2204496, while the sum is 58.
The spelling of 10173908919361 in words is "ten trillion, one hundred seventy-three billion, nine hundred eight million, nine hundred nineteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •