Base | Representation |
---|---|
bin | 11000100111001000… |
… | …00000111110000110 |
3 | 1021002211210112122000 |
4 | 30103210000332012 |
5 | 204030024011100 |
6 | 10023042450130 |
7 | 645301404012 |
oct | 142344007606 |
9 | 37084715560 |
10 | 13213110150 |
11 | 5670502249 |
12 | 2689063946 |
13 | 1327599396 |
14 | 8d4ba1542 |
15 | 524eea900 |
hex | 313900f86 |
13213110150 has 192 divisors, whose sum is σ = 39993868800. Its totient is φ = 3192773760.
The previous prime is 13213110149. The next prime is 13213110271. The reversal of 13213110150 is 5101131231.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 578752 + ... + 601148.
It is an arithmetic number, because the mean of its divisors is an integer number (208301400).
Almost surely, 213213110150 is an apocalyptic number.
13213110150 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 13213110150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19996934400).
13213110150 is an abundant number, since it is smaller than the sum of its proper divisors (26780758650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13213110150 is a wasteful number, since it uses less digits than its factorization.
13213110150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22460 (or 22449 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
Adding to 13213110150 its reverse (5101131231), we get a palindrome (18314241381).
The spelling of 13213110150 in words is "thirteen billion, two hundred thirteen million, one hundred ten thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •