Base | Representation |
---|---|
bin | 101100100110110101001… |
… | …000010100101011111111 |
3 | 101212001012112211200021122 |
4 | 230212311020110223333 |
5 | 400210314214240111 |
6 | 10304111432221155 |
7 | 434315146452623 |
oct | 54466510245377 |
9 | 11761175750248 |
10 | 3065350540031 |
11 | a8200a51474a |
12 | 41610383a7bb |
13 | 1930a49308c0 |
14 | a8514219183 |
15 | 54b0ba91cdb |
hex | 2c9b5214aff |
3065350540031 has 16 divisors (see below), whose sum is σ = 3479033241600. Its totient is φ = 2677435220448.
The previous prime is 3065350540013. The next prime is 3065350540039. The reversal of 3065350540031 is 1300450535603.
It is a cyclic number.
It is not a de Polignac number, because 3065350540031 - 214 = 3065350523647 is a prime.
It is a super-2 number, since 2×30653505400312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3065350539973 and 3065350540000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3065350540039) 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, 7188671 + ... + 7603136.
It is an arithmetic number, because the mean of its divisors is an integer number (217439577600).
Almost surely, 23065350540031 is an apocalyptic number.
3065350540031 is a deficient number, since it is larger than the sum of its proper divisors (413682701569).
3065350540031 is a wasteful number, since it uses less digits than its factorization.
3065350540031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14792678.
The product of its (nonzero) digits is 81000, while the sum is 35.
The spelling of 3065350540031 in words is "three trillion, sixty-five billion, three hundred fifty million, five hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •