Base | Representation |
---|---|
bin | 11011000110010… |
… | …10010011101000 |
3 | 120211202002212200 |
4 | 31203022103220 |
5 | 431143233224 |
6 | 34320140200 |
7 | 5430124425 |
oct | 1543122350 |
9 | 524662780 |
10 | 227321064 |
11 | 107353753 |
12 | 64167660 |
13 | 38131b09 |
14 | 22294d4c |
15 | 14e545c9 |
hex | d8ca4e8 |
227321064 has 48 divisors (see below), whose sum is σ = 623095200. Its totient is φ = 74858784.
The previous prime is 227321027. The next prime is 227321069. The reversal of 227321064 is 460123722.
It is a super-2 number, since 2×2273210642 = 103349732276184192, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (227321069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13044 + ... + 24995.
It is an arithmetic number, because the mean of its divisors is an integer number (12981150).
Almost surely, 2227321064 is an apocalyptic number.
227321064 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
227321064 is an abundant number, since it is smaller than the sum of its proper divisors (395774136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
227321064 is a wasteful number, since it uses less digits than its factorization.
227321064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38134 (or 38127 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 227321064 is about 15077.1702915368. The cubic root of 227321064 is about 610.3044829461.
Adding to 227321064 its reverse (460123722), we get a palindrome (687444786).
The spelling of 227321064 in words is "two hundred twenty-seven million, three hundred twenty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •