Base | Representation |
---|---|
bin | 1101111100011111001001… |
… | …00000110011100100111101 |
3 | 11000120121021202112221200002 |
4 | 12332033210200303210331 |
5 | 13004411124431100021 |
6 | 145115330135244045 |
7 | 6313342200351455 |
oct | 676174440634475 |
9 | 130517252487602 |
10 | 30665605331261 |
11 | 9853234838a8a |
12 | 3533249219625 |
13 | 14159a5bc98a4 |
14 | 78031a718d65 |
15 | 382a3952350b |
hex | 1be3e483393d |
30665605331261 has 16 divisors (see below), whose sum is σ = 32477843046384. Its totient is φ = 28854299787264.
The previous prime is 30665605331213. The next prime is 30665605331281. The reversal of 30665605331261 is 16213350656603.
It can be written as a sum of positive squares in 8 ways, for example, as 311566028761 + 30354039302500 = 558181^2 + 5509450^2 .
It is not a de Polignac number, because 30665605331261 - 230 = 30664531589437 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30665605331281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1884438821 + ... + 1884455093.
It is an arithmetic number, because the mean of its divisors is an integer number (2029865190399).
Almost surely, 230665605331261 is an apocalyptic number.
It is an amenable number.
30665605331261 is a deficient number, since it is larger than the sum of its proper divisors (1812237715123).
30665605331261 is a wasteful number, since it uses less digits than its factorization.
30665605331261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38080.
The product of its (nonzero) digits is 1749600, while the sum is 47.
Adding to 30665605331261 its reverse (16213350656603), we get a palindrome (46878955987864).
The spelling of 30665605331261 in words is "thirty trillion, six hundred sixty-five billion, six hundred five million, three hundred thirty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •