Base | Representation |
---|---|
bin | 1101010001110110100… |
… | …0011010000110111000 |
3 | 210210211210120222222000 |
4 | 3110131220122012320 |
5 | 12214202340224043 |
6 | 252445054101000 |
7 | 22324166252025 |
oct | 3243550320670 |
9 | 723753528860 |
10 | 228130398648 |
11 | 88827732049 |
12 | 382684aa760 |
13 | 18688264c89 |
14 | b0820d654c |
15 | 5e02d972d3 |
hex | 351da1a1b8 |
228130398648 has 128 divisors (see below), whose sum is σ = 638343763200. Its totient is φ = 75486632832.
The previous prime is 228130398637. The next prime is 228130398667. The reversal of 228130398648 is 846893031822.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 228130398594 and 228130398603.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44320411 + ... + 44325557.
It is an arithmetic number, because the mean of its divisors is an integer number (4987060650).
Almost surely, 2228130398648 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 228130398648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (319171881600).
228130398648 is an abundant number, since it is smaller than the sum of its proper divisors (410213364552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
228130398648 is a wasteful number, since it uses less digits than its factorization.
228130398648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6626 (or 6616 counting only the distinct ones).
The product of its (nonzero) digits is 3981312, while the sum is 54.
The spelling of 228130398648 in words is "two hundred twenty-eight billion, one hundred thirty million, three hundred ninety-eight thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •