Base | Representation |
---|---|
bin | 10111111100110000110001… |
… | …110001011100110111110101 |
3 | 111210221111201112010220221112 |
4 | 113330300301301130313311 |
5 | 102301214043412422010 |
6 | 1012004114323324405 |
7 | 31120612532146541 |
oct | 2774606161346765 |
9 | 453844645126845 |
10 | 105330613014005 |
11 | 3061a50a0a0505 |
12 | b991941220705 |
13 | 46a0832405182 |
14 | 1c02059318a21 |
15 | c29d57017a05 |
hex | 5fcc31c5cdf5 |
105330613014005 has 16 divisors (see below), whose sum is σ = 129600705250800. Its totient is φ = 82132355811840.
The previous prime is 105330613013981. The next prime is 105330613014049. The reversal of 105330613014005 is 500410316033501.
It can be written as a sum of positive squares in 8 ways, for example, as 106859687236 + 105223753326769 = 326894^2 + 10257863^2 .
It is not a de Polignac number, because 105330613014005 - 238 = 105055735107061 is a prime.
It is a super-2 number, since 2×1053306130140052 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 240102590 + ... + 240540879.
It is an arithmetic number, because the mean of its divisors is an integer number (8100044078175).
Almost surely, 2105330613014005 is an apocalyptic number.
It is an amenable number.
105330613014005 is a deficient number, since it is larger than the sum of its proper divisors (24270092236795).
105330613014005 is a wasteful number, since it uses less digits than its factorization.
105330613014005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 480644584.
The product of its (nonzero) digits is 16200, while the sum is 32.
Adding to 105330613014005 its reverse (500410316033501), we get a palindrome (605740929047506).
The spelling of 105330613014005 in words is "one hundred five trillion, three hundred thirty billion, six hundred thirteen million, fourteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •