Base | Representation |
---|---|
bin | 11100001111010001… |
… | …111100011001001011 |
3 | 2220021010120011012210 |
4 | 130033101330121023 |
5 | 444044202230011 |
6 | 21532423040203 |
7 | 2122246244022 |
oct | 341721743113 |
9 | 86233504183 |
10 | 30321133131 |
11 | 1194a542113 |
12 | 5a625a0063 |
13 | 2b22a81cc3 |
14 | 1678d5d8b9 |
15 | bc6e0e6a6 |
hex | 70f47c64b |
30321133131 has 8 divisors (see below), whose sum is σ = 40915264320. Its totient is φ = 19970545352.
The previous prime is 30321133127. The next prime is 30321133189. The reversal of 30321133131 is 13133112303.
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 30321133131 - 22 = 30321133127 is a prime.
It is a super-2 number, since 2×303211331312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30321133098 and 30321133107.
It is not an unprimeable number, because it can be changed into a prime (30321133111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60885561 + ... + 60886058.
It is an arithmetic number, because the mean of its divisors is an integer number (5114408040).
Almost surely, 230321133131 is an apocalyptic number.
30321133131 is a deficient number, since it is larger than the sum of its proper divisors (10594131189).
30321133131 is a wasteful number, since it uses less digits than its factorization.
30321133131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121771705.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 30321133131 its reverse (13133112303), we get a palindrome (43454245434).
The spelling of 30321133131 in words is "thirty billion, three hundred twenty-one million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •