Base | Representation |
---|---|
bin | 110000000010100100111… |
… | …011110100111101100101 |
3 | 102200121020102012021211021 |
4 | 300002210323310331211 |
5 | 413042031304431211 |
6 | 11004332555411141 |
7 | 460340225154001 |
oct | 60024473647545 |
9 | 12617212167737 |
10 | 3301302030181 |
11 | 106308aa27581 |
12 | 453993453ab1 |
13 | 1ac40832786c |
14 | b5ad8d27701 |
15 | 5ad1b394771 |
hex | 300a4ef4f65 |
3301302030181 has 2 divisors, whose sum is σ = 3301302030182. Its totient is φ = 3301302030180.
The previous prime is 3301302030167. The next prime is 3301302030283. The reversal of 3301302030181 is 1810302031033.
3301302030181 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2226783202081 + 1074518828100 = 1492241^2 + 1036590^2 .
It is a cyclic number.
It is not a de Polignac number, because 3301302030181 - 27 = 3301302030053 is a prime.
It is a super-2 number, since 2×33013020301812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3301302030161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1650651015090 + 1650651015091.
It is an arithmetic number, because the mean of its divisors is an integer number (1650651015091).
Almost surely, 23301302030181 is an apocalyptic number.
It is an amenable number.
3301302030181 is a deficient number, since it is larger than the sum of its proper divisors (1).
3301302030181 is an equidigital number, since it uses as much as digits as its factorization.
3301302030181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
The spelling of 3301302030181 in words is "three trillion, three hundred one billion, three hundred two million, thirty thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •