Base | Representation |
---|---|
bin | 11000101101110011… |
… | …01001010110001000 |
3 | 1021020202011202000000 |
4 | 30112321221112020 |
5 | 204133343042300 |
6 | 10032403043000 |
7 | 646551410211 |
oct | 142671512610 |
9 | 37222152000 |
10 | 13269112200 |
11 | 569a082433 |
12 | 26a3970460 |
13 | 13360766a6 |
14 | 8dc3bc408 |
15 | 529dadc00 |
hex | 316e69588 |
13269112200 has 168 divisors, whose sum is σ = 46255377450. Its totient is φ = 3538391040.
The previous prime is 13269112151. The next prime is 13269112201. The reversal of 13269112200 is 221196231.
It can be written as a sum of positive squares in 3 ways, for example, as 8103240324 + 5165871876 = 90018^2 + 71874^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (13269112201) by changing a digit.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 100296 + ... + 191304.
Almost surely, 213269112200 is an apocalyptic number.
13269112200 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 13269112200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23127688725).
13269112200 is an abundant number, since it is smaller than the sum of its proper divisors (32986265250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13269112200 is an equidigital number, since it uses as much as digits as its factorization.
13269112200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91043 (or 91019 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The spelling of 13269112200 in words is "thirteen billion, two hundred sixty-nine million, one hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •