Base | Representation |
---|---|
bin | 11100001010000010… |
… | …111001000000010101 |
3 | 2220001000021211012101 |
4 | 130022002321000111 |
5 | 443404211113023 |
6 | 21520004322101 |
7 | 2120131550506 |
oct | 341202710025 |
9 | 86030254171 |
10 | 30233301013 |
11 | 11904a01593 |
12 | 5a390a3331 |
13 | 2b0a80ba36 |
14 | 166b418bad |
15 | bbe3601ad |
hex | 70a0b9015 |
30233301013 has 4 divisors (see below), whose sum is σ = 30238468780. Its totient is φ = 30228133248.
The previous prime is 30233300987. The next prime is 30233301023. The reversal of 30233301013 is 31010333203.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 29083209444 + 1150091569 = 170538^2 + 33913^2 .
It is a cyclic number.
It is not a de Polignac number, because 30233301013 - 213 = 30233292821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30233301023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2575098 + ... + 2586811.
It is an arithmetic number, because the mean of its divisors is an integer number (7559617195).
Almost surely, 230233301013 is an apocalyptic number.
It is an amenable number.
30233301013 is a deficient number, since it is larger than the sum of its proper divisors (5167767).
30233301013 is an equidigital number, since it uses as much as digits as its factorization.
30233301013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5167766.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 30233301013 its reverse (31010333203), we get a palindrome (61243634216).
The spelling of 30233301013 in words is "thirty billion, two hundred thirty-three million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •