Base | Representation |
---|---|
bin | 100010001001110010110100… |
… | …0100110000000110100010011 |
3 | 1110101200020002101021012122010 |
4 | 1010103211220212000310103 |
5 | 303333432310013022003 |
6 | 2542531534401114003 |
7 | 120164066124256410 |
oct | 10423455046006423 |
9 | 1411606071235563 |
10 | 300413242314003 |
11 | 877a25a4590385 |
12 | 2983a123028903 |
13 | cb81b02396000 |
14 | 54281155dd107 |
15 | 24ae687ac1003 |
hex | 1113968980d13 |
300413242314003 has 32 divisors (see below), whose sum is σ = 495902909555200. Its totient is φ = 158459732185248.
The previous prime is 300413242313971. The next prime is 300413242314013.
It is a happy number.
300413242314003 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 300413242314003 - 25 = 300413242313971 is a prime.
It is a super-2 number, since 2×3004132423140032 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (300413242314013) 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 31 ways as a sum of consecutive naturals, for example, 3255618973 + ... + 3255711246.
It is an arithmetic number, because the mean of its divisors is an integer number (15496965923600).
Almost surely, 2300413242314003 is an apocalyptic number.
300413242314003 is a deficient number, since it is larger than the sum of its proper divisors (195489667241197).
300413242314003 is an equidigital number, since it uses as much as digits as its factorization.
300413242314003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6511330268 (or 6511330242 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 30.
The spelling of 300413242314003 in words is "three hundred trillion, four hundred thirteen billion, two hundred forty-two million, three hundred fourteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •