Base | Representation |
---|---|
bin | 1001001100000101100001… |
… | …1101010101001001110001 |
3 | 1022202212020122222121201001 |
4 | 2103001120131111021301 |
5 | 2311012422233222032 |
6 | 33253211230042001 |
7 | 2061635611636300 |
oct | 223013035251161 |
9 | 38685218877631 |
10 | 10103247164017 |
11 | 32458436a6547 |
12 | 11720b1049301 |
13 | 58396960b097 |
14 | 26cddd534437 |
15 | 127c1e2953e7 |
hex | 93058755271 |
10103247164017 has 12 divisors (see below), whose sum is σ = 12039409514916. Its totient is φ = 8448708428160.
The previous prime is 10103247163987. The next prime is 10103247164083. The reversal of 10103247164017 is 71046174230101.
It can be written as a sum of positive squares in 2 ways, for example, as 2079828349921 + 8023418814096 = 1442161^2 + 2832564^2 .
It is a de Polignac number, because none of the positive numbers 2k-10103247164017 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10103247464017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2514494548 + ... + 2514498565.
It is an arithmetic number, because the mean of its divisors is an integer number (1003284126243).
Almost surely, 210103247164017 is an apocalyptic number.
It is an amenable number.
10103247164017 is a deficient number, since it is larger than the sum of its proper divisors (1936162350899).
10103247164017 is an equidigital number, since it uses as much as digits as its factorization.
10103247164017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5028993168 (or 5028993161 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 37.
The spelling of 10103247164017 in words is "ten trillion, one hundred three billion, two hundred forty-seven million, one hundred sixty-four thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •