Base | Representation |
---|---|
bin | 11000011011000110… |
… | …00100111101011100 |
3 | 1020211210220211101000 |
4 | 30031203010331130 |
5 | 203323210413202 |
6 | 10005035550300 |
7 | 642634604256 |
oct | 141543047534 |
9 | 36753824330 |
10 | 13112201052 |
11 | 561954a7a5 |
12 | 265b2bb390 |
13 | 130c6c7b62 |
14 | 8c5614cd6 |
15 | 51b21691c |
hex | 30d8c4f5c |
13112201052 has 48 divisors (see below), whose sum is σ = 34018784800. Its totient is φ = 4367623680.
The previous prime is 13112201051. The next prime is 13112201071. The reversal of 13112201052 is 25010221131.
13112201052 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 (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13112201051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111852 + ... + 196812.
Almost surely, 213112201052 is an apocalyptic number.
13112201052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13112201052 is an abundant number, since it is smaller than the sum of its proper divisors (20906583748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13112201052 is a wasteful number, since it uses less digits than its factorization.
13112201052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86403 (or 86395 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 13112201052 its reverse (25010221131), we get a palindrome (38122422183).
The spelling of 13112201052 in words is "thirteen billion, one hundred twelve million, two hundred one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •