Base | Representation |
---|---|
bin | 1101101111111011010011… |
… | …10011111010110010000101 |
3 | 10222001100100221002101120210 |
4 | 12313331221303322302011 |
5 | 12430323313300424331 |
6 | 144145155243150033 |
7 | 6240223641603105 |
oct | 667755163726205 |
9 | 128040327071523 |
10 | 30234050014341 |
11 | 96a720903aa78 |
12 | 348368a215319 |
13 | 13b409bc069b4 |
14 | 76749b729205 |
15 | 3766cc6cb446 |
hex | 1b7f69cfac85 |
30234050014341 has 8 divisors (see below), whose sum is σ = 42064765237440. Its totient is φ = 19279684067072.
The previous prime is 30234050014339. The next prime is 30234050014367. The reversal of 30234050014341 is 14341005043203.
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 30234050014341 - 21 = 30234050014339 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30234050014299 and 30234050014308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30234050014331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 219087318876 + ... + 219087319013.
It is an arithmetic number, because the mean of its divisors is an integer number (5258095654680).
Almost surely, 230234050014341 is an apocalyptic number.
It is an amenable number.
30234050014341 is a deficient number, since it is larger than the sum of its proper divisors (11830715223099).
30234050014341 is a wasteful number, since it uses less digits than its factorization.
30234050014341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 438174637915.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 30234050014341 its reverse (14341005043203), we get a palindrome (44575055057544).
The spelling of 30234050014341 in words is "thirty trillion, two hundred thirty-four billion, fifty million, fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •