Base | Representation |
---|---|
bin | 1101101100000100000101… |
… | …00100001011001000100000 |
3 | 10221120122202211122200102121 |
4 | 12312002002210023020200 |
5 | 12421140001230044412 |
6 | 144004204530554024 |
7 | 6224514542450314 |
oct | 666020244131040 |
9 | 127518684580377 |
10 | 30101321331232 |
11 | 9655998173938 |
12 | 3461a07738914 |
13 | 13a4708914c98 |
14 | 760ca9ac1b44 |
15 | 373010019107 |
hex | 1b608290b220 |
30101321331232 has 12 divisors (see below), whose sum is σ = 59261976370926. Its totient is φ = 15050660665600.
The previous prime is 30101321331227. The next prime is 30101321331239. The reversal of 30101321331232 is 23213312310103.
It can be written as a sum of positive squares in only one way, i.e., 19425915210256 + 10675406120976 = 4407484^2 + 3267324^2 .
It is a junction number, because it is equal to n+sod(n) for n = 30101321331197 and 30101321331206.
It is not an unprimeable number, because it can be changed into a prime (30101321331239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 470333145769 + ... + 470333145832.
Almost surely, 230101321331232 is an apocalyptic number.
30101321331232 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30101321331232 is a deficient number, since it is larger than the sum of its proper divisors (29160655039694).
30101321331232 is an equidigital number, since it uses as much as digits as its factorization.
30101321331232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 940666291611 (or 940666291603 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 30101321331232 its reverse (23213312310103), we get a palindrome (53314633641335).
The spelling of 30101321331232 in words is "thirty trillion, one hundred one billion, three hundred twenty-one million, three hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •