Base | Representation |
---|---|
bin | 1000101111100000000… |
… | …11111010011011100111 |
3 | 1001201100000112022200111 |
4 | 10113300003322123213 |
5 | 14410134324113111 |
6 | 345554240153451 |
7 | 30462463300606 |
oct | 4276003723347 |
9 | 1051300468614 |
10 | 300380301031 |
11 | 106432938078 |
12 | 4a270908887 |
13 | 22430863ac5 |
14 | 10777859a3d |
15 | 7c30c80a21 |
hex | 45f00fa6e7 |
300380301031 has 4 divisors (see below), whose sum is σ = 303187593672. Its totient is φ = 297573008392.
The previous prime is 300380300947. The next prime is 300380301059. The reversal of 300380301031 is 130103083003.
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 300380301031 - 219 = 300379776743 is a prime.
It is a super-2 number, since 2×3003803010312 (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 = 300380300993 and 300380301011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300380304031) 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, 1403646160 + ... + 1403646373.
It is an arithmetic number, because the mean of its divisors is an integer number (75796898418).
Almost surely, 2300380301031 is an apocalyptic number.
300380301031 is a deficient number, since it is larger than the sum of its proper divisors (2807292641).
300380301031 is a wasteful number, since it uses less digits than its factorization.
300380301031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2807292640.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 300380301031 its reverse (130103083003), we get a palindrome (430483384034).
The spelling of 300380301031 in words is "three hundred billion, three hundred eighty million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •