Base | Representation |
---|---|
bin | 10011110000000111… |
… | …11011011000001000 |
3 | 1000101000201201001220 |
4 | 21320003323120020 |
5 | 133204140331102 |
6 | 4512125242040 |
7 | 523532316615 |
oct | 117003733010 |
9 | 30330651056 |
10 | 10604230152 |
11 | 45518a207a |
12 | 207b403320 |
13 | cccc375c9 |
14 | 7284cb50c |
15 | 420e641bc |
hex | 2780fb608 |
10604230152 has 32 divisors (see below), whose sum is σ = 26529290880. Its totient is φ = 3532248000.
The previous prime is 10604230073. The next prime is 10604230159. The reversal of 10604230152 is 25103240601.
It is a super-4 number, since 4×106042301524 (a number of 41 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (10604230159) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121099 + ... + 189402.
It is an arithmetic number, because the mean of its divisors is an integer number (829040340).
Almost surely, 210604230152 is an apocalyptic number.
10604230152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10604230152 is an abundant number, since it is smaller than the sum of its proper divisors (15925060728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10604230152 is a wasteful number, since it uses less digits than its factorization.
10604230152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311933 (or 311929 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 10604230152 its reverse (25103240601), we get a palindrome (35707470753).
The spelling of 10604230152 in words is "ten billion, six hundred four million, two hundred thirty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •