Base | Representation |
---|---|
bin | 1101101101000111100010… |
… | …01100001110000100010101 |
3 | 10221201010020202221101021120 |
4 | 12312203301030032010111 |
5 | 12422233133441424031 |
6 | 144032554323434153 |
7 | 6230236156204566 |
oct | 666436114160425 |
9 | 127633222841246 |
10 | 30137537061141 |
11 | 966a291a94834 |
12 | 3468a34225959 |
13 | 13a7c5a979a73 |
14 | 76294385416d |
15 | 373e2e690a96 |
hex | 1b68f130e115 |
30137537061141 has 8 divisors (see below), whose sum is σ = 40208481681984. Its totient is φ = 20079141907200.
The previous prime is 30137537061139. The next prime is 30137537061169. The reversal of 30137537061141 is 14116073573103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30137537061141 - 21 = 30137537061139 is a prime.
It is a super-2 number, since 2×301375370611412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30137537061093 and 30137537061102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30137537066141) 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, 3137361121 + ... + 3137370726.
It is an arithmetic number, because the mean of its divisors is an integer number (5026060210248).
Almost surely, 230137537061141 is an apocalyptic number.
It is an amenable number.
30137537061141 is a deficient number, since it is larger than the sum of its proper divisors (10070944620843).
30137537061141 is a wasteful number, since it uses less digits than its factorization.
30137537061141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6274733451.
The product of its (nonzero) digits is 158760, while the sum is 42.
The spelling of 30137537061141 in words is "thirty trillion, one hundred thirty-seven billion, five hundred thirty-seven million, sixty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •