Base | Representation |
---|---|
bin | 1000101111011001000… |
… | …01110100001111011101 |
3 | 1001201011220000002200002 |
4 | 10113230201310033131 |
5 | 14410024140444013 |
6 | 345544321544045 |
7 | 30461143434224 |
oct | 4275441641735 |
9 | 1051156002602 |
10 | 300321031133 |
11 | 106402435792 |
12 | 4a254aa5025 |
13 | 224214b1266 |
14 | 1076da2bcbb |
15 | 7c2a974358 |
hex | 45ec8743dd |
300321031133 has 4 divisors (see below), whose sum is σ = 300815794560. Its totient is φ = 299826267708.
The previous prime is 300321031103. The next prime is 300321031211. The reversal of 300321031133 is 331130123003.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 331130123003 = 9923 ⋅33369961.
It is a cyclic number.
It is not a de Polignac number, because 300321031133 - 26 = 300321031069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300321031103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 247380803 + ... + 247382016.
It is an arithmetic number, because the mean of its divisors is an integer number (75203948640).
Almost surely, 2300321031133 is an apocalyptic number.
It is an amenable number.
300321031133 is a deficient number, since it is larger than the sum of its proper divisors (494763427).
300321031133 is an equidigital number, since it uses as much as digits as its factorization.
300321031133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494763426.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 300321031133 its reverse (331130123003), we get a palindrome (631451154136).
The spelling of 300321031133 in words is "three hundred billion, three hundred twenty-one million, thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •