Base | Representation |
---|---|
bin | 1101110011001000001001… |
… | …01001110010110011111011 |
3 | 10222102212020001210122202221 |
4 | 12321210010221302303323 |
5 | 12434124024113324011 |
6 | 144311503512504511 |
7 | 6251166103262413 |
oct | 671440451626373 |
9 | 128385201718687 |
10 | 30344022011131 |
11 | 97399113a3934 |
12 | 34a0a5b6ab137 |
13 | 13c157667a74a |
14 | 76c930cdd643 |
15 | 3794b70e1971 |
hex | 1b9904a72cfb |
30344022011131 has 16 divisors (see below), whose sum is σ = 32291124465600. Its totient is φ = 28414943631360.
The previous prime is 30344022011117. The next prime is 30344022011137. The reversal of 30344022011131 is 13111022044303.
It is a cyclic number.
It is not a de Polignac number, because 30344022011131 - 27 = 30344022011003 is a prime.
It is a super-2 number, since 2×303440220111312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30344022011096 and 30344022011105.
It is not an unprimeable number, because it can be changed into a prime (30344022011137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 243232851 + ... + 243357571.
It is an arithmetic number, because the mean of its divisors is an integer number (2018195279100).
Almost surely, 230344022011131 is an apocalyptic number.
30344022011131 is a deficient number, since it is larger than the sum of its proper divisors (1947102454469).
30344022011131 is a wasteful number, since it uses less digits than its factorization.
30344022011131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196854.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 30344022011131 its reverse (13111022044303), we get a palindrome (43455044055434).
The spelling of 30344022011131 in words is "thirty trillion, three hundred forty-four billion, twenty-two million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •