Base | Representation |
---|---|
bin | 11100001111110100… |
… | …100111001100010011 |
3 | 2220021202122212212210 |
4 | 130033310213030103 |
5 | 444104014040311 |
6 | 21533345523203 |
7 | 2122416425154 |
oct | 341764471423 |
9 | 86252585783 |
10 | 30330221331 |
11 | 1195468a223 |
12 | 5a65643503 |
13 | 2b24914837 |
14 | 167a24792b |
15 | bc7b073a6 |
hex | 70fd27313 |
30330221331 has 8 divisors (see below), whose sum is σ = 41203319760. Its totient is φ = 19838635232.
The previous prime is 30330221293. The next prime is 30330221413. The reversal of 30330221331 is 13312203303.
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 30330221331 - 210 = 30330220307 is a prime.
It is a super-2 number, since 2×303302213312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30330221298 and 30330221307.
It is not an unprimeable number, because it can be changed into a prime (30330221231) 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, 95377896 + ... + 95378213.
It is an arithmetic number, because the mean of its divisors is an integer number (5150414970).
Almost surely, 230330221331 is an apocalyptic number.
30330221331 is a deficient number, since it is larger than the sum of its proper divisors (10873098429).
30330221331 is a wasteful number, since it uses less digits than its factorization.
30330221331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190756165.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 30330221331 its reverse (13312203303), we get a palindrome (43642424634).
The spelling of 30330221331 in words is "thirty billion, three hundred thirty million, two hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •