Base | Representation |
---|---|
bin | 1011110101000000001000… |
… | …1101110100110100011000 |
3 | 1201001021200121201221211020 |
4 | 2331100002031310310120 |
5 | 3201034121211312221 |
6 | 43354301111002440 |
7 | 2511410635222365 |
oct | 275200215646430 |
9 | 51037617657736 |
10 | 13005198150936 |
11 | 4164523347502 |
12 | 15605b2669420 |
13 | 7345008a4784 |
14 | 32d65254746c |
15 | 178465bceac6 |
hex | bd402374d18 |
13005198150936 has 128 divisors (see below), whose sum is σ = 33439966560000. Its totient is φ = 4213310722560.
The previous prime is 13005198150887. The next prime is 13005198150947. The reversal of 13005198150936 is 63905189150031.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 71061195 + ... + 71243973.
It is an arithmetic number, because the mean of its divisors is an integer number (261249738750).
Almost surely, 213005198150936 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13005198150936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16719983280000).
13005198150936 is an abundant number, since it is smaller than the sum of its proper divisors (20434768409064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13005198150936 is a wasteful number, since it uses less digits than its factorization.
13005198150936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183417 (or 183413 counting only the distinct ones).
The product of its (nonzero) digits is 874800, while the sum is 51.
The spelling of 13005198150936 in words is "thirteen trillion, five billion, one hundred ninety-eight million, one hundred fifty thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •