Base | Representation |
---|---|
bin | 1101010100000011010… |
… | …1101000001111011000 |
3 | 210212100222001001120110 |
4 | 3111000311220033120 |
5 | 12221410043120333 |
6 | 253023434124320 |
7 | 22344630664062 |
oct | 3250065501730 |
9 | 725328031513 |
10 | 228721066968 |
11 | 89000096989 |
12 | 383b22806a0 |
13 | 18750744264 |
14 | b0da730732 |
15 | 5e39b70063 |
hex | 3540d683d8 |
228721066968 has 256 divisors, whose sum is σ = 617360486400. Its totient is φ = 70452264960.
The previous prime is 228721066963. The next prime is 228721066999. The reversal of 228721066968 is 869660127822.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (228721066961) 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 63 ways as a sum of consecutive naturals, for example, 780617830 + ... + 780618122.
It is an arithmetic number, because the mean of its divisors is an integer number (2411564400).
Almost surely, 2228721066968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 228721066968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (308680243200).
228721066968 is an abundant number, since it is smaller than the sum of its proper divisors (388639419432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
228721066968 is a wasteful number, since it uses less digits than its factorization.
228721066968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722 (or 718 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 57.
The spelling of 228721066968 in words is "two hundred twenty-eight billion, seven hundred twenty-one million, sixty-six thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •