Base | Representation |
---|---|
bin | 1101110101111111001110… |
… | …01001101110001100001101 |
3 | 10222210020221000110111011210 |
4 | 12322333213021232030031 |
5 | 12442231323143442031 |
6 | 144425001005405033 |
7 | 6261245565455331 |
oct | 672774711561415 |
9 | 128706830414153 |
10 | 30442311312141 |
11 | 977756a119513 |
12 | 34b7b10569779 |
13 | 13ca90b935b61 |
14 | 7735b6a917c1 |
15 | 37bd1b062746 |
hex | 1bafe726e30d |
30442311312141 has 8 divisors (see below), whose sum is σ = 40598423311680. Its totient is φ = 20290536760352.
The previous prime is 30442311312139. The next prime is 30442311312191. The reversal of 30442311312141 is 14121311324403.
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 30442311312141 - 21 = 30442311312139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30442311312099 and 30442311312108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30442311312131) 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, 1084345560 + ... + 1084373633.
It is an arithmetic number, because the mean of its divisors is an integer number (5074802913960).
Almost surely, 230442311312141 is an apocalyptic number.
It is an amenable number.
30442311312141 is a deficient number, since it is larger than the sum of its proper divisors (10156111999539).
30442311312141 is a wasteful number, since it uses less digits than its factorization.
30442311312141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2168723875.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 30442311312141 its reverse (14121311324403), we get a palindrome (44563622636544).
The spelling of 30442311312141 in words is "thirty trillion, four hundred forty-two billion, three hundred eleven million, three hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •