Base | Representation |
---|---|
bin | 100010010000010000001101… |
… | …1001101010101100011110001 |
3 | 1110111211002112220011121011221 |
4 | 1010200200123031111203301 |
5 | 303443003423032330001 |
6 | 2544451434121105041 |
7 | 120315164500121014 |
oct | 10440403315254361 |
9 | 1414732486147157 |
10 | 301301002230001 |
11 | 88005045948974 |
12 | 299621a0028181 |
13 | cc1774103a457 |
14 | 545909114d37b |
15 | 24c77e57561a1 |
hex | 112081b3558f1 |
301301002230001 has 16 divisors (see below), whose sum is σ = 314793150210000. Its totient is φ = 288015985152000.
The previous prime is 301301002229989. The next prime is 301301002230043. The reversal of 301301002230001 is 100032200103103.
It can be written as a sum of positive squares in 8 ways, for example, as 6888630144400 + 294412372085601 = 2624620^2 + 17158449^2 .
It is a cyclic number.
It is not a de Polignac number, because 301301002230001 - 219 = 301301001705713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (301301002230061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53708281 + ... + 59052361.
It is an arithmetic number, because the mean of its divisors is an integer number (19674571888125).
Almost surely, 2301301002230001 is an apocalyptic number.
It is an amenable number.
301301002230001 is a deficient number, since it is larger than the sum of its proper divisors (13492147979999).
301301002230001 is a wasteful number, since it uses less digits than its factorization.
301301002230001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5363460.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 301301002230001 its reverse (100032200103103), we get a palindrome (401333202333104).
The spelling of 301301002230001 in words is "three hundred one trillion, three hundred one billion, two million, two hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •