Base | Representation |
---|---|
bin | 11111001010110010110101… |
… | …10111001101001100011110 |
3 | 22222200102022010121222002220 |
4 | 33211121122313031030132 |
5 | 32440432133301442344 |
6 | 401435042301130210 |
7 | 20302616162564613 |
oct | 1745313267151436 |
9 | 288612263558086 |
10 | 68540612530974 |
11 | 1a925a01a18421 |
12 | 782b768559966 |
13 | 2c3247653811c |
14 | 12cd551c9250a |
15 | 7dcd72cc8c19 |
hex | 3e565adcd31e |
68540612530974 has 16 divisors (see below), whose sum is σ = 139667663271312. Its totient is φ = 22415797808768.
The previous prime is 68540612530939. The next prime is 68540612530979. The reversal of 68540612530974 is 47903521604586.
It is a happy number.
It is a super-2 number, since 2×685406125309742 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68540612530979) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107768258379 + ... + 107768259014.
It is an arithmetic number, because the mean of its divisors is an integer number (8729228954457).
It is a 2-persistent number, because it is pandigital, and so is 2⋅68540612530974 = 137081225061948, but 3⋅68540612530974 = 205621837592922 is not.
Almost surely, 268540612530974 is an apocalyptic number.
68540612530974 is an abundant number, since it is smaller than the sum of its proper divisors (71127050740338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68540612530974 is a wasteful number, since it uses less digits than its factorization.
68540612530974 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215536517451.
The product of its (nonzero) digits is 43545600, while the sum is 60.
The spelling of 68540612530974 in words is "sixty-eight trillion, five hundred forty billion, six hundred twelve million, five hundred thirty thousand, nine hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •