Base | Representation |
---|---|
bin | 100011110100111101… |
… | …1011010010100001001 |
3 | 21100121000111201210101 |
4 | 1013221323122110021 |
5 | 2230032403002031 |
6 | 55202332045401 |
7 | 5362423433002 |
oct | 1075173322411 |
9 | 240530451711 |
10 | 76939109641 |
11 | 2a6a2137929 |
12 | 12ab2903861 |
13 | 7341c512a4 |
14 | 3a1c4421a9 |
15 | 20048ed361 |
hex | 11e9eda509 |
76939109641 has 9 divisors (see below), whose sum is σ = 77722204359. Its totient is φ = 76163835336.
The previous prime is 76939109633. The next prime is 76939109657. The reversal of 76939109641 is 14690193967.
It is a happy number.
The square root of 76939109641 is 277379.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 31568405625 + 45370704016 = 177675^2 + 213004^2 .
It is not a de Polignac number, because 76939109641 - 23 = 76939109633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (76939109441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 28568691 + ... + 28571383.
Almost surely, 276939109641 is an apocalyptic number.
76939109641 is the 277379-th square number.
76939109641 is the 138690-th centered octagonal number.
It is an amenable number.
76939109641 is a deficient number, since it is larger than the sum of its proper divisors (783094718).
76939109641 is an frugal number, since it uses more digits than its factorization.
76939109641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5592 (or 2796 counting only the distinct ones).
The product of its (nonzero) digits is 2204496, while the sum is 55.
The spelling of 76939109641 in words is "seventy-six billion, nine hundred thirty-nine million, one hundred nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •