Base | Representation |
---|---|
bin | 11000011101011111… |
… | …00111101010100110 |
3 | 1020220012200020111210 |
4 | 30032233213222212 |
5 | 203343330004100 |
6 | 10011034012250 |
7 | 643300264143 |
oct | 141657475246 |
9 | 36805606453 |
10 | 13132266150 |
11 | 5629904a23 |
12 | 2665b77086 |
13 | 1313901ab3 |
14 | 8c81593ca |
15 | 51cd7bc50 |
hex | 30ebe7aa6 |
13132266150 has 96 divisors (see below), whose sum is σ = 32994102528. Its totient is φ = 3456432000.
The previous prime is 13132266089. The next prime is 13132266167. The reversal of 13132266150 is 5166223131.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3690172 + ... + 3693728.
It is an arithmetic number, because the mean of its divisors is an integer number (343688568).
Almost surely, 213132266150 is an apocalyptic number.
13132266150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13132266150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16497051264).
13132266150 is an abundant number, since it is smaller than the sum of its proper divisors (19861836378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13132266150 is a wasteful number, since it uses less digits than its factorization.
13132266150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3886 (or 3881 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 13132266150 its reverse (5166223131), we get a palindrome (18298489281).
The spelling of 13132266150 in words is "thirteen billion, one hundred thirty-two million, two hundred sixty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •