Base | Representation |
---|---|
bin | 1101110010011101010100… |
… | …10110010000100101111001 |
3 | 10222100122212212020101102122 |
4 | 12321032222112100211321 |
5 | 12433234433204314223 |
6 | 144253142335211025 |
7 | 6246423304301126 |
oct | 671165226204571 |
9 | 128318785211378 |
10 | 30321032104313 |
11 | 9730094178645 |
12 | 3498504376a75 |
13 | 13bc3517136a2 |
14 | 76b78d8bb74d |
15 | 378abdb275c8 |
hex | 1b93aa590979 |
30321032104313 has 8 divisors (see below), whose sum is σ = 30823952694528. Its totient is φ = 29821387870224.
The previous prime is 30321032104273. The next prime is 30321032104367. The reversal of 30321032104313 is 31340123012303.
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 30321032104313 - 210 = 30321032103289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30321032104213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 819070370 + ... + 819107387.
It is an arithmetic number, because the mean of its divisors is an integer number (3852994086816).
Almost surely, 230321032104313 is an apocalyptic number.
It is an amenable number.
30321032104313 is a deficient number, since it is larger than the sum of its proper divisors (502920590215).
30321032104313 is a wasteful number, since it uses less digits than its factorization.
30321032104313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1638178063.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 30321032104313 its reverse (31340123012303), we get a palindrome (61661155116616).
The spelling of 30321032104313 in words is "thirty trillion, three hundred twenty-one billion, thirty-two million, one hundred four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •