Base | Representation |
---|---|
bin | 1011110101001000100101… |
… | …1000101111011111101000 |
3 | 1201001111112122222102021221 |
4 | 2331102021120233133220 |
5 | 3201103242234434442 |
6 | 43355314121311424 |
7 | 2511521063124241 |
oct | 275221130573750 |
9 | 51044478872257 |
10 | 13007465936872 |
11 | 4165487465660 |
12 | 1560b26035574 |
13 | 7347a267ac44 |
14 | 32d7c97cbcc8 |
15 | 178549d3b467 |
hex | bd48962f7e8 |
13007465936872 has 32 divisors (see below), whose sum is σ = 27523634824800. Its totient is φ = 5708605739200.
The previous prime is 13007465936869. The next prime is 13007465936879. The reversal of 13007465936872 is 27863956470031.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 13007465936872.
It is not an unprimeable number, because it can be changed into a prime (13007465936879) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2548482154 + ... + 2548487257.
It is an arithmetic number, because the mean of its divisors is an integer number (860113588275).
It is a 1-persistent number, because it is pandigital, but 2⋅13007465936872 = 26014931873744 is not.
Almost surely, 213007465936872 is an apocalyptic number.
It is an amenable number.
13007465936872 is an abundant number, since it is smaller than the sum of its proper divisors (14516168887928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13007465936872 is a wasteful number, since it uses less digits than its factorization.
13007465936872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5096969457 (or 5096969453 counting only the distinct ones).
The product of its (nonzero) digits is 45722880, while the sum is 61.
The spelling of 13007465936872 in words is "thirteen trillion, seven billion, four hundred sixty-five million, nine hundred thirty-six thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •