Base | Representation |
---|---|
bin | 1000101110111110110… |
… | …11101010001100101011 |
3 | 1001200121120120021111102 |
4 | 10113133123222030223 |
5 | 14404101414011243 |
6 | 345510432352015 |
7 | 30452535034430 |
oct | 4273733521453 |
9 | 1050546507442 |
10 | 300101313323 |
11 | 1062aa405519 |
12 | 4a1b33a560b |
13 | 223b7b12116 |
14 | 1074c795b87 |
15 | 7c165229b8 |
hex | 45df6ea32b |
300101313323 has 4 divisors (see below), whose sum is σ = 342972929520. Its totient is φ = 257229697128.
The previous prime is 300101313247. The next prime is 300101313329. The reversal of 300101313323 is 323313101003.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 300101313323 - 28 = 300101313067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300101313295 and 300101313304.
It is not an unprimeable number, because it can be changed into a prime (300101313329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21435808088 + ... + 21435808101.
It is an arithmetic number, because the mean of its divisors is an integer number (85743232380).
Almost surely, 2300101313323 is an apocalyptic number.
300101313323 is a deficient number, since it is larger than the sum of its proper divisors (42871616197).
300101313323 is an equidigital number, since it uses as much as digits as its factorization.
300101313323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42871616196.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 300101313323 its reverse (323313101003), we get a palindrome (623414414326).
The spelling of 300101313323 in words is "three hundred billion, one hundred one million, three hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •