Base | Representation |
---|---|
bin | 1110000110000011111110… |
… | …01011100000111101100001 |
3 | 11001202001112012102200121111 |
4 | 13003001333023200331201 |
5 | 13030303434114423321 |
6 | 145530421505023321 |
7 | 6346200343543501 |
oct | 703017713407541 |
9 | 131661465380544 |
10 | 30994617732961 |
11 | 996a81a756073 |
12 | 3586b6a924b41 |
13 | 143aa1a60619c |
14 | 79220ca65a01 |
15 | 38b393c795e1 |
hex | 1c307f2e0f61 |
30994617732961 has 9 divisors (see below), whose sum is σ = 31027772896081. Its totient is φ = 30961497978292.
The previous prime is 30994617732931. The next prime is 30994617732989. The reversal of 30994617732961 is 16923771649903.
The square root of 30994617732961 is 5567281.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 30994617732961 - 217 = 30994617601889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30994617732931) 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 8 ways as a sum of consecutive naturals, for example, 6474745410 + ... + 6474750196.
Almost surely, 230994617732961 is an apocalyptic number.
30994617732961 is the 5567281-st square number.
30994617732961 is the 2783641-st centered octagonal number.
It is an amenable number.
30994617732961 is a deficient number, since it is larger than the sum of its proper divisors (33155163120).
30994617732961 is an frugal number, since it uses more digits than its factorization.
30994617732961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11900 (or 5950 counting only the distinct ones).
The product of its (nonzero) digits is 92588832, while the sum is 67.
The spelling of 30994617732961 in words is "thirty trillion, nine hundred ninety-four billion, six hundred seventeen million, seven hundred thirty-two thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •