Base | Representation |
---|---|
bin | 1000110000101100011… |
… | …00101011011100001101 |
3 | 1001202222121111011022202 |
4 | 10120112030223130031 |
5 | 14412442123230013 |
6 | 350141534051245 |
7 | 30514362625406 |
oct | 4302614533415 |
9 | 1052877434282 |
10 | 301020133133 |
11 | 106731021435 |
12 | 4a40b049b25 |
13 | 22503297995 |
14 | 107d88109ad |
15 | 7c6c01a858 |
hex | 461632b70d |
301020133133 has 2 divisors, whose sum is σ = 301020133134. Its totient is φ = 301020133132.
The previous prime is 301020133111. The next prime is 301020133151. The reversal of 301020133133 is 331331020103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 225888226729 + 75131906404 = 475277^2 + 274102^2 .
It is an emirp because it is prime and its reverse (331331020103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 301020133133 - 212 = 301020129037 is a prime.
It is a super-2 number, since 2×3010201331332 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (301020133103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150510066566 + 150510066567.
It is an arithmetic number, because the mean of its divisors is an integer number (150510066567).
Almost surely, 2301020133133 is an apocalyptic number.
It is an amenable number.
301020133133 is a deficient number, since it is larger than the sum of its proper divisors (1).
301020133133 is an equidigital number, since it uses as much as digits as its factorization.
301020133133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 301020133133 its reverse (331331020103), we get a palindrome (632351153236).
The spelling of 301020133133 in words is "three hundred one billion, twenty million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •