Base | Representation |
---|---|
bin | 1100001001110100001001… |
… | …0001100111000000101111 |
3 | 1202022110121101100111222011 |
4 | 3002131002101213000233 |
5 | 3222413410310422401 |
6 | 44230433122502051 |
7 | 2546266346565256 |
oct | 302350221470057 |
9 | 52273541314864 |
10 | 13362755170351 |
11 | 4292126a22344 |
12 | 15b995b804927 |
13 | 75c143ca6502 |
14 | 342a918d179d |
15 | 1828e13ca451 |
hex | c274246702f |
13362755170351 has 8 divisors (see below), whose sum is σ = 13393912054464. Its totient is φ = 13331598994560.
The previous prime is 13362755170343. The next prime is 13362755170367. The reversal of 13362755170351 is 15307155726331.
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 13362755170351 - 23 = 13362755170343 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13362755170295 and 13362755170304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13362755173351) 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 7 ways as a sum of consecutive naturals, for example, 68956771 + ... + 69150283.
It is an arithmetic number, because the mean of its divisors is an integer number (1674239006808).
Almost surely, 213362755170351 is an apocalyptic number.
13362755170351 is a deficient number, since it is larger than the sum of its proper divisors (31156884113).
13362755170351 is a wasteful number, since it uses less digits than its factorization.
13362755170351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354161.
The product of its (nonzero) digits is 1984500, while the sum is 49.
The spelling of 13362755170351 in words is "thirteen trillion, three hundred sixty-two billion, seven hundred fifty-five million, one hundred seventy thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •