Base | Representation |
---|---|
bin | 1101101111100011010000… |
… | …11001000110001011001101 |
3 | 10222000010001022001222000021 |
4 | 12313301220121012023031 |
5 | 12430120344133212023 |
6 | 144135222312502141 |
7 | 6236256024432112 |
oct | 667615031061315 |
9 | 128003038058007 |
10 | 30221141304013 |
11 | 96a1794447930 |
12 | 34810870aa951 |
13 | 13b2ac2718c6a |
14 | 7669d5164909 |
15 | 3761c42ad35d |
hex | 1b7c686462cd |
30221141304013 has 8 divisors (see below), whose sum is σ = 32986823481216. Its totient is φ = 27458510076000.
The previous prime is 30221141303957. The next prime is 30221141304017. The reversal of 30221141304013 is 31040314112203.
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 30221141304013 - 217 = 30221141172941 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30221141304017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 762716581 + ... + 762756202.
It is an arithmetic number, because the mean of its divisors is an integer number (4123352935152).
Almost surely, 230221141304013 is an apocalyptic number.
It is an amenable number.
30221141304013 is a deficient number, since it is larger than the sum of its proper divisors (2765682177203).
30221141304013 is a wasteful number, since it uses less digits than its factorization.
30221141304013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1525474595.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 30221141304013 its reverse (31040314112203), we get a palindrome (61261455416216).
The spelling of 30221141304013 in words is "thirty trillion, two hundred twenty-one billion, one hundred forty-one million, three hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •