Base | Representation |
---|---|
bin | 1101101001001100111110… |
… | …11011011011101101111001 |
3 | 10221020021001010212021220011 |
4 | 12310212133123123231321 |
5 | 12413032141430100241 |
6 | 143451110412501521 |
7 | 6214434560314303 |
oct | 664463733335571 |
9 | 127207033767804 |
10 | 30003021331321 |
11 | 9618234400a95 |
12 | 344695317a8a1 |
13 | 1398371381b6c |
14 | 75a222746973 |
15 | 3706aa183281 |
hex | 1b499f6dbb79 |
30003021331321 has 16 divisors (see below), whose sum is σ = 32355445147200. Its totient is φ = 27728058758400.
The previous prime is 30003021331313. The next prime is 30003021331417. The reversal of 30003021331321 is 12313312030003.
It is not a de Polignac number, because 30003021331321 - 23 = 30003021331313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30003021331292 and 30003021331301.
It is not an unprimeable number, because it can be changed into a prime (30003021331301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6572461 + ... + 10158901.
It is an arithmetic number, because the mean of its divisors is an integer number (2022215321700).
Almost surely, 230003021331321 is an apocalyptic number.
It is an amenable number.
30003021331321 is a deficient number, since it is larger than the sum of its proper divisors (2352423815879).
30003021331321 is a wasteful number, since it uses less digits than its factorization.
30003021331321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3597240.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 30003021331321 its reverse (12313312030003), we get a palindrome (42316333361324).
The spelling of 30003021331321 in words is "thirty trillion, three billion, twenty-one million, three hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •