Base | Representation |
---|---|
bin | 1101110101111011101001… |
… | …00111000110001111000001 |
3 | 10222210001222002111001220211 |
4 | 12322331310213012033001 |
5 | 12442213404221223321 |
6 | 144424042201234121 |
7 | 6261150142454200 |
oct | 672756447061701 |
9 | 128701862431824 |
10 | 30440389632961 |
11 | 9776773406500 |
12 | 34b7674a92941 |
13 | 13ca693781799 |
14 | 773473783237 |
15 | 37bc574c10e1 |
hex | 1baf749c63c1 |
30440389632961 has 81 divisors (see below), whose sum is σ = 39464440485057. Its totient is φ = 23393712822480.
The previous prime is 30440389632889. The next prime is 30440389633007. The reversal of 30440389632961 is 16923698304403.
It is a happy number.
The square root of 30440389632961 is 5517281.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 30440389632961 - 27 = 30440389632833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30440389632896 and 30440389632905.
It is not an unprimeable number, because it can be changed into a prime (30440789632961) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 33561619870 + ... + 33561620776.
Almost surely, 230440389632961 is an apocalyptic number.
30440389632961 is the 5517281-st square number.
30440389632961 is the 2758641-st centered octagonal number.
It is an amenable number.
30440389632961 is a deficient number, since it is larger than the sum of its proper divisors (9024050852096).
30440389632961 is an frugal number, since it uses more digits than its factorization.
30440389632961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2008 (or 1004 counting only the distinct ones).
The product of its (nonzero) digits is 20155392, while the sum is 58.
The spelling of 30440389632961 in words is "thirty trillion, four hundred forty billion, three hundred eighty-nine million, six hundred thirty-two thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •