Base | Representation |
---|---|
bin | 1100000111111110110000… |
… | …0100100010101010001001 |
3 | 1202012110021022202222000202 |
4 | 3001333230010202222021 |
5 | 3221404341444224001 |
6 | 44204142231541545 |
7 | 2544102441311564 |
oct | 301775404425211 |
9 | 52173238688022 |
10 | 13331244133001 |
11 | 427a82684a613 |
12 | 15b382682a8b5 |
13 | 759191856392 |
14 | 34134290d4db |
15 | 181b99cc696b |
hex | c1fec122a89 |
13331244133001 has 8 divisors (see below), whose sum is σ = 14115469466664. Its totient is φ = 12547022632960.
The previous prime is 13331244132991. The next prime is 13331244133003. The reversal of 13331244133001 is 10033144213331.
It can be written as a sum of positive squares in 4 ways, for example, as 1574410110025 + 11756834022976 = 1254755^2 + 3428824^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13331244133001 - 210 = 13331244131977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13331244133003) 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, 9399521 + ... + 10724433.
It is an arithmetic number, because the mean of its divisors is an integer number (1764433683333).
Almost surely, 213331244133001 is an apocalyptic number.
It is an amenable number.
13331244133001 is a deficient number, since it is larger than the sum of its proper divisors (784225333663).
13331244133001 is a wasteful number, since it uses less digits than its factorization.
13331244133001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1916811.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 13331244133001 its reverse (10033144213331), we get a palindrome (23364388346332).
The spelling of 13331244133001 in words is "thirteen trillion, three hundred thirty-one billion, two hundred forty-four million, one hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •