Base | Representation |
---|---|
bin | 100010010000010101011001… |
… | …0100110110011101001001001 |
3 | 1110111212011021120011201011021 |
4 | 1010200222302212303221021 |
5 | 303443144221320413113 |
6 | 2544500514351032441 |
7 | 120316040345244112 |
oct | 10440526246635111 |
9 | 1414764246151137 |
10 | 301312132201033 |
11 | 88009837488938 |
12 | 2996438750b721 |
13 | cc187c5b70325 |
14 | 54598293b3209 |
15 | 24c7c4791a48d |
hex | 1120ab29b3a49 |
301312132201033 has 32 divisors (see below), whose sum is σ = 320469931837440. Its totient is φ = 282316691865600.
The previous prime is 301312132200991. The next prime is 301312132201039. The reversal of 301312132201033 is 330102231213103.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-301312132201033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 301312132200989 and 301312132201007.
It is not an unprimeable number, because it can be changed into a prime (301312132201039) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11279593285 + ... + 11279619997.
It is an arithmetic number, because the mean of its divisors is an integer number (10014685369920).
Almost surely, 2301312132201033 is an apocalyptic number.
It is an amenable number.
301312132201033 is a deficient number, since it is larger than the sum of its proper divisors (19157799636407).
301312132201033 is a wasteful number, since it uses less digits than its factorization.
301312132201033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30217.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 301312132201033 its reverse (330102231213103), we get a palindrome (631414363414136).
The spelling of 301312132201033 in words is "three hundred one trillion, three hundred twelve billion, one hundred thirty-two million, two hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •