Base | Representation |
---|---|
bin | 1011111010100001101101… |
… | …1101101001100011010000 |
3 | 1201101100200021000202121200 |
4 | 2332220123131221203100 |
5 | 3204113011404310000 |
6 | 43510035150551200 |
7 | 2521310651216250 |
oct | 276503335514320 |
9 | 51340607022550 |
10 | 13100111010000 |
11 | 41a07a91672a3 |
12 | 1576a80808500 |
13 | 740448494b41 |
14 | 334097b01960 |
15 | 17ab6d4ed500 |
hex | bea1b7698d0 |
13100111010000 has 600 divisors, whose sum is σ = 53020648961280. Its totient is φ = 2956397184000.
The previous prime is 13100111009987. The next prime is 13100111010013. The reversal of 13100111010000 is 1011100131.
It is an interprime number because it is at equal distance from previous prime (13100111009987) and next prime (13100111010013).
It is a tau number, because it is divible by the number of its divisors (600).
It is a super-2 number, since 2×131001110100002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 49638394 + ... + 49901606.
Almost surely, 213100111010000 is an apocalyptic number.
13100111010000 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 13100111010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26510324480640).
13100111010000 is an abundant number, since it is smaller than the sum of its proper divisors (39920537951280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13100111010000 is a wasteful number, since it uses less digits than its factorization.
13100111010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263333 (or 263309 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 13100111010000 its reverse (1011100131), we get a palindrome (13101122110131).
The spelling of 13100111010000 in words is "thirteen trillion, one hundred billion, one hundred eleven million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •