Base | Representation |
---|---|
bin | 1000101110111111111… |
… | …00111010010011000111 |
3 | 1001200122011222010120011 |
4 | 10113133330322103013 |
5 | 14404111131430043 |
6 | 345511343251051 |
7 | 30453002110516 |
oct | 4273774722307 |
9 | 1050564863504 |
10 | 300110030023 |
11 | 106304319501 |
12 | 4a1b62a9a87 |
13 | 223b987482b |
14 | 1074d9c467d |
15 | 7c1719559d |
hex | 45dff3a4c7 |
300110030023 has 8 divisors (see below), whose sum is σ = 300856961360. Its totient is φ = 299364024960.
The previous prime is 300110029991. The next prime is 300110030039. The reversal of 300110030023 is 320030011003.
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 300110030023 - 25 = 300110029991 is a prime.
It is a super-2 number, since 2×3001100300232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300110029985 and 300110030012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300110034023) 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, 419503 + ... + 881023.
It is an arithmetic number, because the mean of its divisors is an integer number (37607120170).
Almost surely, 2300110030023 is an apocalyptic number.
300110030023 is a deficient number, since it is larger than the sum of its proper divisors (746931337).
300110030023 is an equidigital number, since it uses as much as digits as its factorization.
300110030023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 463137.
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 300110030023 its reverse (320030011003), we get a palindrome (620140041026).
The spelling of 300110030023 in words is "three hundred billion, one hundred ten million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •