Base | Representation |
---|---|
bin | 1000101110110110101… |
… | …00000001000100111111 |
3 | 1001200102202112000020121 |
4 | 10113123110001010333 |
5 | 14403431220413043 |
6 | 345455523155411 |
7 | 30451035426022 |
oct | 4273324010477 |
9 | 1050382460217 |
10 | 300032201023 |
11 | 1062743a0415 |
12 | 4a194215b67 |
13 | 223a66c4679 |
14 | 107435251b9 |
15 | 7c1041eded |
hex | 45db50113f |
300032201023 has 4 divisors (see below), whose sum is σ = 304142231248. Its totient is φ = 295922170800.
The previous prime is 300032201009. The next prime is 300032201041. The reversal of 300032201023 is 320102230003.
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 300032201023 - 25 = 300032200991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300032200988 and 300032201006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300032204023) 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 3 ways as a sum of consecutive naturals, for example, 2055015003 + ... + 2055015148.
It is an arithmetic number, because the mean of its divisors is an integer number (76035557812).
Almost surely, 2300032201023 is an apocalyptic number.
300032201023 is a deficient number, since it is larger than the sum of its proper divisors (4110030225).
300032201023 is an equidigital number, since it uses as much as digits as its factorization.
300032201023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4110030224.
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 300032201023 its reverse (320102230003), we get a palindrome (620134431026).
The spelling of 300032201023 in words is "three hundred billion, thirty-two million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •