Base | Representation |
---|---|
bin | 110101010110110001010100… |
… | …001110101000100101000111 |
3 | 1010202212101200201121022111222 |
4 | 311112301110032220211013 |
5 | 221224142213023303011 |
6 | 2151025515513550555 |
7 | 100266500303623664 |
oct | 6526612416504507 |
9 | 1122771621538458 |
10 | 234661246306631 |
11 | 68852303a30201 |
12 | 2239ab0871545b |
13 | a0c25cab69981 |
14 | 41d394478ca6b |
15 | 1c1e126a29ddb |
hex | d56c543a8947 |
234661246306631 has 16 divisors (see below), whose sum is σ = 248519881548288. Its totient is φ = 221107310133600.
The previous prime is 234661246306519. The next prime is 234661246306639. The reversal of 234661246306631 is 136603642166432.
It is a cyclic number.
It is not a de Polignac number, because 234661246306631 - 222 = 234661242112327 is a prime.
It is a super-2 number, since 2×2346612463066312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (234661246306639) 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 15 ways as a sum of consecutive naturals, for example, 519878861 + ... + 520330041.
It is an arithmetic number, because the mean of its divisors is an integer number (15532492596768).
Almost surely, 2234661246306631 is an apocalyptic number.
234661246306631 is a deficient number, since it is larger than the sum of its proper divisors (13858635241657).
234661246306631 is a wasteful number, since it uses less digits than its factorization.
234661246306631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 788782.
The product of its (nonzero) digits is 13436928, while the sum is 53.
The spelling of 234661246306631 in words is "two hundred thirty-four trillion, six hundred sixty-one billion, two hundred forty-six million, three hundred six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •