Base | Representation |
---|---|
bin | 100010001000010101100100… |
… | …1111111111010100011010011 |
3 | 1110100222002021001112202011012 |
4 | 1010100223021333322203103 |
5 | 303322142222313443443 |
6 | 2542255542040441135 |
7 | 120143450220404243 |
oct | 10420531177724323 |
9 | 1410862231482135 |
10 | 300213013031123 |
11 | 877256953565a5 |
12 | 298073627791ab |
13 | cb68c727090ba |
14 | 541c55ccb5b23 |
15 | 24a936945b118 |
hex | 1110ac9ffa8d3 |
300213013031123 has 8 divisors (see below), whose sum is σ = 304557697715040. Its totient is φ = 295871559802560.
The previous prime is 300213013031021. The next prime is 300213013031149. The reversal of 300213013031123 is 321130310312003.
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 300213013031123 - 216 = 300213012965587 is a prime.
It is a super-2 number, since 2×3002130130311232 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (300213013031623) 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, 807676688 + ... + 808048301.
It is an arithmetic number, because the mean of its divisors is an integer number (38069712214380).
Almost surely, 2300213013031123 is an apocalyptic number.
300213013031123 is a deficient number, since it is larger than the sum of its proper divisors (4344684683917).
300213013031123 is a wasteful number, since it uses less digits than its factorization.
300213013031123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1615727677.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 300213013031123 its reverse (321130310312003), we get a palindrome (621343323343126).
The spelling of 300213013031123 in words is "three hundred trillion, two hundred thirteen billion, thirteen million, thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •