Base | Representation |
---|---|
bin | 11100001010100101… |
… | …001110000110101011 |
3 | 2220001122020000221110 |
4 | 130022211032012223 |
5 | 443414012102311 |
6 | 21520525241403 |
7 | 2120301211545 |
oct | 341245160653 |
9 | 86048200843 |
10 | 30242300331 |
11 | 11909a98941 |
12 | 5a40103263 |
13 | 2b0c63cc89 |
14 | 166c6bc695 |
15 | bc003b8a6 |
hex | 70a94e1ab |
30242300331 has 8 divisors (see below), whose sum is σ = 42695012304. Its totient is φ = 18975560960.
The previous prime is 30242300327. The next prime is 30242300377. The reversal of 30242300331 is 13300324203.
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 30242300331 - 22 = 30242300327 is a prime.
It is a super-2 number, since 2×302423003312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30242300298 and 30242300307.
It is not an unprimeable number, because it can be changed into a prime (30242300311) 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 7 ways as a sum of consecutive naturals, for example, 296493090 + ... + 296493191.
It is an arithmetic number, because the mean of its divisors is an integer number (5336876538).
Almost surely, 230242300331 is an apocalyptic number.
30242300331 is a deficient number, since it is larger than the sum of its proper divisors (12452711973).
30242300331 is a wasteful number, since it uses less digits than its factorization.
30242300331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592986301.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 30242300331 its reverse (13300324203), we get a palindrome (43542624534).
The spelling of 30242300331 in words is "thirty billion, two hundred forty-two million, three hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •