Base | Representation |
---|---|
bin | 11100001010000010… |
… | …100111101111011101 |
3 | 2220001000011020012102 |
4 | 130022002213233131 |
5 | 443404201332201 |
6 | 21520003014445 |
7 | 2120131134401 |
oct | 341202475735 |
9 | 86030136172 |
10 | 30233230301 |
11 | 1190496344a |
12 | 5a3906a425 |
13 | 2b0a7b57b1 |
14 | 166b3db101 |
15 | bbe34926b |
hex | 70a0a7bdd |
30233230301 has 8 divisors (see below), whose sum is σ = 30995475000. Its totient is φ = 29472168960.
The previous prime is 30233230259. The next prime is 30233230309. The reversal of 30233230301 is 10303233203.
It can be written as a sum of positive squares in 4 ways, for example, as 1689127801 + 28544102500 = 41099^2 + 168950^2 .
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 30233230301 - 210 = 30233229277 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 (30233230309) 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 7 ways as a sum of consecutive naturals, for example, 243986 + ... + 346403.
It is an arithmetic number, because the mean of its divisors is an integer number (3874434375).
Almost surely, 230233230301 is an apocalyptic number.
It is an amenable number.
30233230301 is a deficient number, since it is larger than the sum of its proper divisors (762244699).
30233230301 is a wasteful number, since it uses less digits than its factorization.
30233230301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591679.
The product of its (nonzero) digits is 972, while the sum is 20.
Adding to 30233230301 its reverse (10303233203), we get a palindrome (40536463504).
The spelling of 30233230301 in words is "thirty billion, two hundred thirty-three million, two hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •