Base | Representation |
---|---|
bin | 1101110100111010010100… |
… | …10101000001101001011101 |
3 | 10222122201110001202020210020 |
4 | 12322131022111001221131 |
5 | 12441130044022423031 |
6 | 144400002244302353 |
7 | 6255466121044236 |
oct | 672351225015135 |
9 | 128581401666706 |
10 | 30405320514141 |
11 | 9762907846481 |
12 | 34b09083a19b9 |
13 | 13c729513a3c1 |
14 | 7718a800408d |
15 | 37ada383b096 |
hex | 1ba74a541a5d |
30405320514141 has 8 divisors (see below), whose sum is σ = 41205024522144. Its totient is φ = 19937915091120.
The previous prime is 30405320514103. The next prime is 30405320514199. The reversal of 30405320514141 is 14141502350403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30405320514141 - 26 = 30405320514077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30405320519141) 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, 83074646031 + ... + 83074646396.
It is an arithmetic number, because the mean of its divisors is an integer number (5150628065268).
Almost surely, 230405320514141 is an apocalyptic number.
It is an amenable number.
30405320514141 is a deficient number, since it is larger than the sum of its proper divisors (10799704008003).
30405320514141 is a wasteful number, since it uses less digits than its factorization.
30405320514141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166149292491.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 30405320514141 its reverse (14141502350403), we get a palindrome (44546822864544).
The spelling of 30405320514141 in words is "thirty trillion, four hundred five billion, three hundred twenty million, five hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •