Base | Representation |
---|---|
bin | 100010001000010000000101… |
… | …0100011100000011100011111 |
3 | 1110100220221210120022200012100 |
4 | 1010100200022203200130133 |
5 | 303321444040031420221 |
6 | 2542250311010340143 |
7 | 120142551603454200 |
oct | 10420401243403437 |
9 | 1410827716280170 |
10 | 300201211201311 |
11 | 87720689548142 |
12 | 2980500a28a653 |
13 | cb67b1163aa54 |
14 | 541bb5d7215a7 |
15 | 24a8dc82d2926 |
hex | 111080a8e071f |
300201211201311 has 36 divisors (see below), whose sum is σ = 507805089597000. Its totient is φ = 170392250232288.
The previous prime is 300201211201273. The next prime is 300201211201321. The reversal of 300201211201311 is 113102112102003.
300201211201311 is a `hidden beast` number, since 30 + 0 + 2 + 0 + 121 + 1 + 201 + 311 = 666.
It is not a de Polignac number, because 300201211201311 - 225 = 300201177646879 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300201211201321) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2284257681 + ... + 2284389098.
It is an arithmetic number, because the mean of its divisors is an integer number (14105696933250).
Almost surely, 2300201211201311 is an apocalyptic number.
300201211201311 is a deficient number, since it is larger than the sum of its proper divisors (207603878395689).
300201211201311 is a wasteful number, since it uses less digits than its factorization.
300201211201311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4568646948 (or 4568646938 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 300201211201311 its reverse (113102112102003), we get a palindrome (413303323303314).
The spelling of 300201211201311 in words is "three hundred trillion, two hundred one billion, two hundred eleven million, two hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •