Base | Representation |
---|---|
bin | 10011010011001101… |
… | …00011101111101000 |
3 | 222202010021100212110 |
4 | 21221212203233220 |
5 | 132210040301102 |
6 | 4432102042320 |
7 | 514525400400 |
oct | 115146435750 |
9 | 28663240773 |
10 | 10361650152 |
11 | 4437977137 |
12 | 20121193a0 |
13 | c918c2349 |
14 | 7041c3800 |
15 | 4099e886c |
hex | 2699a3be8 |
10361650152 has 144 divisors (see below), whose sum is σ = 31804112160. Its totient is φ = 2804542272.
The previous prime is 10361650141. The next prime is 10361650153. The reversal of 10361650152 is 25105616301.
It is a super-3 number, since 3×103616501523 (a number of 31 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (10361650153) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 412333 + ... + 436739.
It is an arithmetic number, because the mean of its divisors is an integer number (220861890).
Almost surely, 210361650152 is an apocalyptic number.
10361650152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10361650152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15902056080).
10361650152 is an abundant number, since it is smaller than the sum of its proper divisors (21442462008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10361650152 is a wasteful number, since it uses less digits than its factorization.
10361650152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24468 (or 24438 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 10361650152 in words is "ten billion, three hundred sixty-one million, six hundred fifty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •