Base | Representation |
---|---|
bin | 1000101111001011110… |
… | …10010101111010111111 |
3 | 1001200220011010011001210 |
4 | 10113211322111322333 |
5 | 14404312231120111 |
6 | 345525314335503 |
7 | 30455325031545 |
oct | 4274572257277 |
9 | 1050804104053 |
10 | 300210020031 |
11 | 106355803479 |
12 | 4a22388a593 |
13 | 224044b390c |
14 | 1075cdb1d95 |
15 | 7c20d470a6 |
hex | 45e5e95ebf |
300210020031 has 8 divisors (see below), whose sum is σ = 423825910704. Its totient is φ = 188367071360.
The previous prime is 300210020027. The next prime is 300210020059. The reversal of 300210020031 is 130020012003.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 300210020031 - 22 = 300210020027 is a prime.
It is a super-2 number, since 2×3002100200312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 300210019989 and 300210020016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300210020021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2943235440 + ... + 2943235541.
It is an arithmetic number, because the mean of its divisors is an integer number (52978238838).
Almost surely, 2300210020031 is an apocalyptic number.
300210020031 is a deficient number, since it is larger than the sum of its proper divisors (123615890673).
300210020031 is a wasteful number, since it uses less digits than its factorization.
300210020031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5886471001.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 300210020031 its reverse (130020012003), we get a palindrome (430230032034).
The spelling of 300210020031 in words is "three hundred billion, two hundred ten million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •