Base | Representation |
---|---|
bin | 10011101010011001111… |
… | …000011001101001011001 |
3 | 11210011200112212121010022 |
4 | 103222121320121221121 |
5 | 134114230031230410 |
6 | 2512422224000225 |
7 | 166423013436662 |
oct | 23523170315131 |
9 | 4704615777108 |
10 | 1351201430105 |
11 | 48104aa8848a |
12 | 199a56760075 |
13 | 9a557a3c547 |
14 | 4958169c369 |
15 | 25233ed9455 |
hex | 13a99e19a59 |
1351201430105 has 8 divisors (see below), whose sum is σ = 1716820640712. Its totient is φ = 1017375194368.
The previous prime is 1351201430099. The next prime is 1351201430113. The reversal of 1351201430105 is 5010341021531.
It can be written as a sum of positive squares in 4 ways, for example, as 272370215881 + 1078831214224 = 521891^2 + 1038668^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1351201430105 is a prime.
It is a super-2 number, since 2×13512014301052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7948243622 + ... + 7948243791.
It is an arithmetic number, because the mean of its divisors is an integer number (214602580089).
Almost surely, 21351201430105 is an apocalyptic number.
It is an amenable number.
1351201430105 is a deficient number, since it is larger than the sum of its proper divisors (365619210607).
1351201430105 is a wasteful number, since it uses less digits than its factorization.
1351201430105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15896487435.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 1351201430105 its reverse (5010341021531), we get a palindrome (6361542451636).
The spelling of 1351201430105 in words is "one trillion, three hundred fifty-one billion, two hundred one million, four hundred thirty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •