Base | Representation |
---|---|
bin | 1101001100110010101… |
… | …0100100010001001101 |
3 | 210200100010112201010121 |
4 | 3103030222210101031 |
5 | 12203412113310221 |
6 | 252102211104541 |
7 | 22245423165322 |
oct | 3231452442115 |
9 | 720303481117 |
10 | 226772010061 |
11 | 8819a984653 |
12 | 37b495a2151 |
13 | 184cc9c564c |
14 | ad93936b49 |
15 | 5d739c1a41 |
hex | 34ccaa444d |
226772010061 has 8 divisors (see below), whose sum is σ = 234100065024. Its totient is φ = 219444756960.
The previous prime is 226772009969. The next prime is 226772010131. The reversal of 226772010061 is 160010277622.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 226772010061 - 215 = 226771977293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 226772009999 and 226772010026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226772610061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 403185 + ... + 784921.
It is an arithmetic number, because the mean of its divisors is an integer number (29262508128).
Almost surely, 2226772010061 is an apocalyptic number.
It is an amenable number.
226772010061 is a deficient number, since it is larger than the sum of its proper divisors (7328054963).
226772010061 is a wasteful number, since it uses less digits than its factorization.
226772010061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400931.
The product of its (nonzero) digits is 14112, while the sum is 34.
Adding to 226772010061 its reverse (160010277622), we get a palindrome (386782287683).
The spelling of 226772010061 in words is "two hundred twenty-six billion, seven hundred seventy-two million, ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •