Base | Representation |
---|---|
bin | 1000101111001101010… |
… | …00100011000000010001 |
3 | 1001200220222220111220011 |
4 | 10113212220203000101 |
5 | 14404323331212431 |
6 | 345530430114521 |
7 | 30455533006243 |
oct | 4274650430021 |
9 | 1050828814804 |
10 | 300222132241 |
11 | 106361626569 |
12 | 4a22794ba41 |
13 | 22406b649c5 |
14 | 10760846093 |
15 | 7c21e3acb1 |
hex | 45e6a23011 |
300222132241 has 4 divisors (see below), whose sum is σ = 309906717184. Its totient is φ = 290537547300.
The previous prime is 300222132173. The next prime is 300222132247. The reversal of 300222132241 is 142231222003.
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.
It is a cyclic number.
It is not a de Polignac number, because 300222132241 - 225 = 300188577809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (300222132247) 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, 4842292425 + ... + 4842292486.
It is an arithmetic number, because the mean of its divisors is an integer number (77476679296).
Almost surely, 2300222132241 is an apocalyptic number.
300222132241 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
300222132241 is a deficient number, since it is larger than the sum of its proper divisors (9684584943).
300222132241 is an equidigital number, since it uses as much as digits as its factorization.
300222132241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9684584942.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 300222132241 its reverse (142231222003), we get a palindrome (442453354244).
The spelling of 300222132241 in words is "three hundred billion, two hundred twenty-two million, one hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •