Base | Representation |
---|---|
bin | 10001111010110… |
… | …100000100111011 |
3 | 202221200121021201 |
4 | 101322310010323 |
5 | 1103430132311 |
6 | 45455315031 |
7 | 10310213161 |
oct | 2172640473 |
9 | 687617251 |
10 | 300630331 |
11 | 144775021 |
12 | 8481ba77 |
13 | 4a38b991 |
14 | 2bcd9231 |
15 | 1b5d59c1 |
hex | 11eb413b |
300630331 has 6 divisors (see below), whose sum is σ = 317286132. Its totient is φ = 284807340.
The previous prime is 300630307. The next prime is 300630359. The reversal of 300630331 is 133036003.
It is not a de Polignac number, because 300630331 - 25 = 300630299 is a prime.
It is a super-2 number, since 2×3006303312 = 180757191834339122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300630299 and 300630308.
It is not an unprimeable number, because it can be changed into a prime (300630301) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 416025 + ... + 416746.
It is an arithmetic number, because the mean of its divisors is an integer number (52881022).
Almost surely, 2300630331 is an apocalyptic number.
300630331 is the 10011-st hex number.
300630331 is a deficient number, since it is larger than the sum of its proper divisors (16655801).
300630331 is an equidigital number, since it uses as much as digits as its factorization.
300630331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832809 (or 832790 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 19.
The square root of 300630331 is about 17338.6946163776. The cubic root of 300630331 is about 669.9014713656.
Adding to 300630331 its reverse (133036003), we get a palindrome (433666334).
The spelling of 300630331 in words is "three hundred million, six hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •