Base | Representation |
---|---|
bin | 1101010111001011110… |
… | …0011110101111100100 |
3 | 210221112112212212001111 |
4 | 3111302330132233210 |
5 | 12230120300131001 |
6 | 253243104234404 |
7 | 22404516312622 |
oct | 3256274365744 |
9 | 727475785044 |
10 | 229561723876 |
11 | 893a1676961 |
12 | 385a790ba04 |
13 | 18855960994 |
14 | b17a240512 |
15 | 5e88878851 |
hex | 3572f1ebe4 |
229561723876 has 27 divisors (see below), whose sum is σ = 411840852073. Its totient is φ = 111962163680.
The previous prime is 229561723871. The next prime is 229561723921. The reversal of 229561723876 is 678327165922.
It is a happy number.
The square root of 229561723876 is 479126.
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., 11061570276 + 218500153600 = 105174^2 + 467440^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 229561723876.
It is not an unprimeable number, because it can be changed into a prime (229561723871) 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 8 ways as a sum of consecutive naturals, for example, 39285411 + ... + 39291253.
Almost surely, 2229561723876 is an apocalyptic number.
229561723876 is the 479126-th square number.
It is an amenable number.
229561723876 is a deficient number, since it is larger than the sum of its proper divisors (182279128197).
229561723876 is an frugal number, since it uses more digits than its factorization.
229561723876 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11772 (or 5886 counting only the distinct ones).
The product of its digits is 15240960, while the sum is 58.
The spelling of 229561723876 in words is "two hundred twenty-nine billion, five hundred sixty-one million, seven hundred twenty-three thousand, eight hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •