Base | Representation |
---|---|
bin | 1101111010100111110011… |
… | …01001001100011000110011 |
3 | 11000100110220121120021102201 |
4 | 12331103321221030120303 |
5 | 13002333421021422011 |
6 | 145030052401124031 |
7 | 6305613400420315 |
oct | 675237151143063 |
9 | 130313817507381 |
10 | 30601535342131 |
11 | 9829046a13946 |
12 | 3522948329617 |
13 | 140c9351b4410 |
14 | 77b19d4d37b5 |
15 | 381039822cc1 |
hex | 1bd4f9a4c633 |
30601535342131 has 32 divisors (see below), whose sum is σ = 35096703667200. Its totient is φ = 26431912604160.
The previous prime is 30601535342117. The next prime is 30601535342167. The reversal of 30601535342131 is 13124353510603.
It is not a de Polignac number, because 30601535342131 - 27 = 30601535342003 is a prime.
It is a super-2 number, since 2×306015353421312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30601535343131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32226976 + ... + 33162946.
It is an arithmetic number, because the mean of its divisors is an integer number (1096771989600).
Almost surely, 230601535342131 is an apocalyptic number.
30601535342131 is a deficient number, since it is larger than the sum of its proper divisors (4495168325069).
30601535342131 is a wasteful number, since it uses less digits than its factorization.
30601535342131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 936859.
The product of its (nonzero) digits is 97200, while the sum is 37.
Adding to 30601535342131 its reverse (13124353510603), we get a palindrome (43725888852734).
The spelling of 30601535342131 in words is "thirty trillion, six hundred one billion, five hundred thirty-five million, three hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •