Base | Representation |
---|---|
bin | 111111101111001001… |
… | …010111001101110001 |
3 | 20112122110202111201220 |
4 | 333233021113031301 |
5 | 2110124244442244 |
6 | 51234524215253 |
7 | 4641632336331 |
oct | 775711271561 |
9 | 215573674656 |
10 | 68436718449 |
11 | 2702981a550 |
12 | 1131b39a529 |
13 | 65b85c9898 |
14 | 345315d0c1 |
15 | 1ba8266319 |
hex | fef257371 |
68436718449 has 32 divisors (see below), whose sum is σ = 103090606080. Its totient is φ = 40007908800.
The previous prime is 68436718439. The next prime is 68436718459. The reversal of 68436718449 is 94481763486.
It is an interprime number because it is at equal distance from previous prime (68436718439) and next prime (68436718459).
It is not a de Polignac number, because 68436718449 - 24 = 68436718433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 68436718392 and 68436718401.
It is not an unprimeable number, because it can be changed into a prime (68436718409) 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 31 ways as a sum of consecutive naturals, for example, 205107 + ... + 423015.
It is an arithmetic number, because the mean of its divisors is an integer number (3221581440).
Almost surely, 268436718449 is an apocalyptic number.
It is an amenable number.
68436718449 is a deficient number, since it is larger than the sum of its proper divisors (34653887631).
68436718449 is a wasteful number, since it uses less digits than its factorization.
68436718449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218261.
The product of its digits is 27869184, while the sum is 60.
It can be divided in two parts, 68436 and 718449, that added together give a triangular number (786885 = T1254).
The spelling of 68436718449 in words is "sixty-eight billion, four hundred thirty-six million, seven hundred eighteen thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •