Base | Representation |
---|---|
bin | 11100001110101111… |
… | …010000101101101001 |
3 | 2220020111110020121002 |
4 | 130032233100231221 |
5 | 444034340310241 |
6 | 21531500124345 |
7 | 2122106046212 |
oct | 341657205551 |
9 | 86214406532 |
10 | 30312041321 |
11 | 119453a2321 |
12 | 5a5b5366b5 |
13 | 2b20c1a933 |
14 | 1677a74409 |
15 | bc621589b |
hex | 70ebd0b69 |
30312041321 has 16 divisors (see below), whose sum is σ = 31475678976. Its totient is φ = 29170800000.
The previous prime is 30312041281. The next prime is 30312041323. The reversal of 30312041321 is 12314021303.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30312041321 is a prime.
It is a super-2 number, since 2×303120413212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30312041293 and 30312041302.
It is not an unprimeable number, because it can be changed into a prime (30312041323) 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 15 ways as a sum of consecutive naturals, for example, 1108706 + ... + 1135716.
It is an arithmetic number, because the mean of its divisors is an integer number (1967229936).
Almost surely, 230312041321 is an apocalyptic number.
It is an amenable number.
30312041321 is a deficient number, since it is larger than the sum of its proper divisors (1163637655).
30312041321 is a wasteful number, since it uses less digits than its factorization.
30312041321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27424.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 30312041321 its reverse (12314021303), we get a palindrome (42626062624).
The spelling of 30312041321 in words is "thirty billion, three hundred twelve million, forty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •