Base | Representation |
---|---|
bin | 100000000000111011… |
… | …0000000110110011001 |
3 | 20120110100000212001100 |
4 | 1000001312000312121 |
5 | 2111300101210314 |
6 | 51330011542013 |
7 | 4652461604322 |
oct | 1000166006631 |
9 | 216410025040 |
10 | 68750413209 |
11 | 2717a8a8015 |
12 | 113a845a909 |
13 | 66385b0b9a |
14 | 3482a99449 |
15 | 1bc5a7cc09 |
hex | 1001d80d99 |
68750413209 has 27 divisors (see below), whose sum is σ = 100806420117. Its totient is φ = 45151356600.
The previous prime is 68750413189. The next prime is 68750413241. The reversal of 68750413209 is 90231405786.
The square root of 68750413209 is 262203.
It is a perfect power (a square), and thus also a powerful number.
68750413209 is a `hidden beast` number, since 6 + 8 + 7 + 504 + 132 + 0 + 9 = 666.
It is not a de Polignac number, because 68750413209 - 29 = 68750412697 is a prime.
It is not an unprimeable number, because it can be changed into a prime (68750413009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 55848624 + ... + 55849854.
It is a 1-persistent number, because it is pandigital, but 2⋅68750413209 = 137500826418 is not.
Almost surely, 268750413209 is an apocalyptic number.
68750413209 is the 262203-rd square number.
68750413209 is the 131102-nd centered octagonal number.
It is an amenable number.
68750413209 is a deficient number, since it is larger than the sum of its proper divisors (32056006908).
68750413209 is an frugal number, since it uses more digits than its factorization.
68750413209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2610 (or 1305 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The spelling of 68750413209 in words is "sixty-eight billion, seven hundred fifty million, four hundred thirteen thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •