Base | Representation |
---|---|
bin | 11000011011000000… |
… | …00001111000010000 |
3 | 1020211202102020021111 |
4 | 30031200001320100 |
5 | 203323004331000 |
6 | 10005010503104 |
7 | 642625035544 |
oct | 141540017020 |
9 | 36752366244 |
10 | 13111402000 |
11 | 5619054424 |
12 | 265ab94a94 |
13 | 130c4a8248 |
14 | 8c5487a24 |
15 | 51b109cba |
hex | 30d801e10 |
13111402000 has 80 divisors (see below), whose sum is σ = 32378141952. Its totient is φ = 5132937600.
The previous prime is 13111401983. The next prime is 13111402033. The reversal of 13111402000 is 20411131.
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24259 + ... + 163741.
Almost surely, 213111402000 is an apocalyptic number.
13111402000 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 13111402000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16189070976).
13111402000 is an abundant number, since it is smaller than the sum of its proper divisors (19266739952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13111402000 is a wasteful number, since it uses less digits than its factorization.
13111402000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139553 (or 139537 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 13111402000 its reverse (20411131), we get a palindrome (13131813131).
The spelling of 13111402000 in words is "thirteen billion, one hundred eleven million, four hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •