Base | Representation |
---|---|
bin | 100011101100100010… |
… | …1011111111000010001 |
3 | 21022212022210202202121 |
4 | 1013121011133320101 |
5 | 2223443033304301 |
6 | 55114315414241 |
7 | 5352422564212 |
oct | 1073105377021 |
9 | 238768722677 |
10 | 76656541201 |
11 | 2a567689a99 |
12 | 12a34154381 |
13 | 72c8547826 |
14 | 39d2ac9409 |
15 | 1ed9bd43a1 |
hex | 11d915fe11 |
76656541201 has 4 divisors (see below), whose sum is σ = 76688577252. Its totient is φ = 76624505152.
The previous prime is 76656541193. The next prime is 76656541279. The reversal of 76656541201 is 10214565667.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 39591050625 + 37065490576 = 198975^2 + 192524^2 .
It is a cyclic number.
It is not a de Polignac number, because 76656541201 - 23 = 76656541193 is a prime.
It is a super-2 number, since 2×766565412012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (76657541201) 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 3 ways as a sum of consecutive naturals, for example, 16014436 + ... + 16019221.
It is an arithmetic number, because the mean of its divisors is an integer number (19172144313).
Almost surely, 276656541201 is an apocalyptic number.
It is an amenable number.
76656541201 is a deficient number, since it is larger than the sum of its proper divisors (32036051).
76656541201 is a wasteful number, since it uses less digits than its factorization.
76656541201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32036050.
The product of its (nonzero) digits is 302400, while the sum is 43.
The spelling of 76656541201 in words is "seventy-six billion, six hundred fifty-six million, five hundred forty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •