Base | Representation |
---|---|
bin | 1101111010100101111010… |
… | …01010011001001011111011 |
3 | 11000100101021220012211002222 |
4 | 12331102331022121023323 |
5 | 13002324331240311011 |
6 | 145025403552314255 |
7 | 6305546266514006 |
oct | 675227512311373 |
9 | 130311256184088 |
10 | 30600520635131 |
11 | 9828676165517 |
12 | 352270454298b |
13 | 140c802bc8085 |
14 | 77b10483853d |
15 | 380eca6d8ddb |
hex | 1bd4bd2992fb |
30600520635131 has 4 divisors (see below), whose sum is σ = 30650933355072. Its totient is φ = 30550107915192.
The previous prime is 30600520635059. The next prime is 30600520635151. The reversal of 30600520635131 is 13153602500603.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30600520635131 - 214 = 30600520618747 is a prime.
It is a super-2 number, since 2×306005206351312 (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 = 30600520635091 and 30600520635100.
It is not an unprimeable number, because it can be changed into a prime (30600520635151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25206359060 + ... + 25206360273.
It is an arithmetic number, because the mean of its divisors is an integer number (7662733338768).
Almost surely, 230600520635131 is an apocalyptic number.
30600520635131 is a deficient number, since it is larger than the sum of its proper divisors (50412719941).
30600520635131 is an equidigital number, since it uses as much as digits as its factorization.
30600520635131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50412719940.
The product of its (nonzero) digits is 48600, while the sum is 35.
The spelling of 30600520635131 in words is "thirty trillion, six hundred billion, five hundred twenty million, six hundred thirty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •