Base | Representation |
---|---|
bin | 1101101001100010001101… |
… | …00000010010100100101011 |
3 | 10221021100110010210210210122 |
4 | 12310301012200102210223 |
5 | 12413224010032144001 |
6 | 143500233120233455 |
7 | 6215320111250264 |
oct | 664610640224453 |
9 | 127240403723718 |
10 | 30014414334251 |
11 | 9622050465796 |
12 | 3448bb276b88b |
13 | 139946883b009 |
14 | 75a9c38b996b |
15 | 370b254a2b1b |
hex | 1b4c4681292b |
30014414334251 has 8 divisors (see below), whose sum is σ = 30350799751824. Its totient is φ = 29678797799200.
The previous prime is 30014414334193. The next prime is 30014414334257. The reversal of 30014414334251 is 15243341441003.
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 30014414334251 - 218 = 30014414072107 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30014414334257) 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, 192142121 + ... + 192298266.
It is an arithmetic number, because the mean of its divisors is an integer number (3793849968978).
Almost surely, 230014414334251 is an apocalyptic number.
30014414334251 is a deficient number, since it is larger than the sum of its proper divisors (336385417573).
30014414334251 is a wasteful number, since it uses less digits than its factorization.
30014414334251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384441261.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 30014414334251 its reverse (15243341441003), we get a palindrome (45257755775254).
The spelling of 30014414334251 in words is "thirty trillion, fourteen billion, four hundred fourteen million, three hundred thirty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •