Base | Representation |
---|---|
bin | 100011101011110100… |
… | …0101011101010000010 |
3 | 21022210122000121200212 |
4 | 1013113220223222002 |
5 | 2223420321210200 |
6 | 55112050114122 |
7 | 5352006016004 |
oct | 1072750535202 |
9 | 238718017625 |
10 | 76632210050 |
11 | 2a554980700 |
12 | 12a27b7b942 |
13 | 72c34a8bb6 |
14 | 39cd794374 |
15 | 1ed79ca035 |
hex | 11d7a2ba82 |
76632210050 has 54 divisors (see below), whose sum is σ = 156715737129. Its totient is φ = 27858428400.
The previous prime is 76632210049. The next prime is 76632210059. The reversal of 76632210050 is 5001223667.
It can be written as a sum of positive squares in 2 ways, for example, as 75099565849 + 1532644201 = 274043^2 + 39149^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=195745.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 76632209989 and 76632210016.
It is not an unprimeable number, because it can be changed into a prime (76632210059) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 21530171 + ... + 21533729.
Almost surely, 276632210050 is an apocalyptic number.
76632210050 is an abundant number, since it is smaller than the sum of its proper divisors (80083527079).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76632210050 is an equidigital number, since it uses as much as digits as its factorization.
76632210050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7152 (or 3577 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 32.
Multiplying 76632210050 by its sum of digits (32), we get a square (2452230721600 = 15659602).
It can be divided in two parts, 76632 and 210050, that added together give a palindrome (286682).
The spelling of 76632210050 in words is "seventy-six billion, six hundred thirty-two million, two hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •