Base | Representation |
---|---|
bin | 110010011001… |
… | …010101111000 |
3 | 220212012002022 |
4 | 302121111320 |
5 | 11340223000 |
6 | 1151054012 |
7 | 220202015 |
oct | 62312570 |
9 | 26765068 |
10 | 13211000 |
11 | 7503690 |
12 | 4511308 |
13 | 297727a |
14 | 1a7c70c |
15 | 125e585 |
hex | c99578 |
13211000 has 64 divisors (see below), whose sum is σ = 33752160. Its totient is φ = 4800000.
The previous prime is 13210937. The next prime is 13211059. The reversal of 13211000 is 11231.
13211000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10400 + ... + 11600.
Almost surely, 213211000 is an apocalyptic number.
13211000 is a gapful number since it is divisible by the number (10) 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 13211000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16876080).
13211000 is an abundant number, since it is smaller than the sum of its proper divisors (20541160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13211000 is a wasteful number, since it uses less digits than its factorization.
13211000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1233 (or 1219 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 13211000 is about 3634.6939348451. The cubic root of 13211000 is about 236.3987799636.
Adding to 13211000 its reverse (11231), we get a palindrome (13222231).
The spelling of 13211000 in words is "thirteen million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •