Base | Representation |
---|---|
bin | 1000101111001101000… |
… | …01010010100111101001 |
3 | 1001200220212022212200021 |
4 | 10113212201102213221 |
5 | 14404322334330441 |
6 | 345530321240441 |
7 | 30455510564560 |
oct | 4274641224751 |
9 | 1050825285607 |
10 | 300220230121 |
11 | 106360547469 |
12 | 4a227193121 |
13 | 22406649ca6 |
14 | 107604acbd7 |
15 | 7c21bb23d1 |
hex | 45e68529e9 |
300220230121 has 8 divisors (see below), whose sum is σ = 343138910144. Its totient is φ = 257309069040.
The previous prime is 300220230073. The next prime is 300220230127. The reversal of 300220230121 is 121032022003.
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 300220230121 - 233 = 291630295529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300220230095 and 300220230104.
It is not an unprimeable number, because it can be changed into a prime (300220230127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1793910 + ... + 1954111.
It is an arithmetic number, because the mean of its divisors is an integer number (42892363768).
Almost surely, 2300220230121 is an apocalyptic number.
It is an amenable number.
300220230121 is a deficient number, since it is larger than the sum of its proper divisors (42918680023).
300220230121 is a wasteful number, since it uses less digits than its factorization.
300220230121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3759471.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 300220230121 its reverse (121032022003), we get a palindrome (421252252124).
The spelling of 300220230121 in words is "three hundred billion, two hundred twenty million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •