Base | Representation |
---|---|
bin | 11100001111010010… |
… | …101000100011110001 |
3 | 2220021010220100100212 |
4 | 130033102220203301 |
5 | 444044224022113 |
6 | 21532430553505 |
7 | 2122250626313 |
oct | 341722504361 |
9 | 86233810325 |
10 | 30321314033 |
11 | 1194a65601a |
12 | 5a62668895 |
13 | 2b22b1644a |
14 | 1678da97b3 |
15 | bc6e480a8 |
hex | 70f4a88f1 |
30321314033 has 4 divisors (see below), whose sum is σ = 30358247028. Its totient is φ = 30284381040.
The previous prime is 30321313999. The next prime is 30321314041. The reversal of 30321314033 is 33041312303.
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 20137880464 + 10183433569 = 141908^2 + 100913^2 .
It is a cyclic number.
It is not a de Polignac number, because 30321314033 - 218 = 30321051889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30321374033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18465266 + ... + 18466907.
It is an arithmetic number, because the mean of its divisors is an integer number (7589561757).
Almost surely, 230321314033 is an apocalyptic number.
It is an amenable number.
30321314033 is a deficient number, since it is larger than the sum of its proper divisors (36932995).
30321314033 is an equidigital number, since it uses as much as digits as its factorization.
30321314033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36932994.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 30321314033 its reverse (33041312303), we get a palindrome (63362626336).
The spelling of 30321314033 in words is "thirty billion, three hundred twenty-one million, three hundred fourteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •