Base | Representation |
---|---|
bin | 100011100101010110… |
… | …0110111100010100001 |
3 | 21022020111200112122211 |
4 | 1013022230313202201 |
5 | 2222444243002424 |
6 | 55034335002121 |
7 | 5343432340552 |
oct | 1071254674241 |
9 | 238214615584 |
10 | 76415203489 |
11 | 2a453432439 |
12 | 12987369341 |
13 | 728a548b51 |
14 | 39aca26329 |
15 | 1ec3911b94 |
hex | 11cab378a1 |
76415203489 has 9 divisors (see below), whose sum is σ = 76707399409. Its totient is φ = 76124119540.
The previous prime is 76415203483. The next prime is 76415203511. The reversal of 76415203489 is 98430251467.
It is a happy number.
The square root of 76415203489 is 276433.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 76415203489 - 29 = 76415202977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (76415203483) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 135728322 + ... + 135728884.
It is a 2-persistent number, because it is pandigital, and so is 2⋅76415203489 = 152830406978, but 3⋅76415203489 = 229245610467 is not.
Almost surely, 276415203489 is an apocalyptic number.
76415203489 is the 276433-rd square number.
76415203489 is the 138217-th centered octagonal number.
It is an amenable number.
76415203489 is a deficient number, since it is larger than the sum of its proper divisors (292195920).
76415203489 is an frugal number, since it uses more digits than its factorization.
76415203489 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2108 (or 1054 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 49.
Multiplying 76415203489 by its sum of digits (49), we get a square (3744344970961 = 19350312).
The spelling of 76415203489 in words is "seventy-six billion, four hundred fifteen million, two hundred three thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •