Base | Representation |
---|---|
bin | 10010111011111011101… |
… | …010010101011001011101 |
3 | 11121101212222212021010201 |
4 | 102323323222111121131 |
5 | 132310031342133201 |
6 | 2433450544303501 |
7 | 163005325031161 |
oct | 22737352253135 |
9 | 4541788767121 |
10 | 1301302302301 |
11 | 461974252191 |
12 | 19024b611b91 |
13 | 95934b5a311 |
14 | 46daa508ca1 |
15 | 23cb341c801 |
hex | 12efba9565d |
1301302302301 has 8 divisors (see below), whose sum is σ = 1377967905720. Its totient is φ = 1224649855488.
The previous prime is 1301302302299. The next prime is 1301302302319. The reversal of 1301302302301 is 1032032031031.
It can be written as a sum of positive squares in 4 ways, for example, as 272144805625 + 1029157496676 = 521675^2 + 1014474^2 .
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 1301302302301 - 21 = 1301302302299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301302302361) 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, 3085146 + ... + 3481483.
It is an arithmetic number, because the mean of its divisors is an integer number (172245988215).
Almost surely, 21301302302301 is an apocalyptic number.
It is an amenable number.
1301302302301 is a deficient number, since it is larger than the sum of its proper divisors (76665603419).
1301302302301 is a wasteful number, since it uses less digits than its factorization.
1301302302301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6578303.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1301302302301 its reverse (1032032031031), we get a palindrome (2333334333332).
The spelling of 1301302302301 in words is "one trillion, three hundred one billion, three hundred two million, three hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •