Base | Representation |
---|---|
bin | 1011110111010001100101… |
… | …1000000000100110111101 |
3 | 1201012000110121111121221002 |
4 | 2331310121120000212331 |
5 | 3202204101244333201 |
6 | 43424235231220045 |
7 | 2514262314331514 |
oct | 275643130004675 |
9 | 51160417447832 |
10 | 13044241402301 |
11 | 417a03923309a |
12 | 156808a077625 |
13 | 7380b3681585 |
14 | 3314b7a2567b |
15 | 17949d6ca76b |
hex | bdd196009bd |
13044241402301 has 16 divisors (see below), whose sum is σ = 13142490218880. Its totient is φ = 12946154572800.
The previous prime is 13044241402183. The next prime is 13044241402303. The reversal of 13044241402301 is 10320414244031.
13044241402301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13044241402301 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13044241402303) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 884168141 + ... + 884182893.
It is an arithmetic number, because the mean of its divisors is an integer number (821405638680).
Almost surely, 213044241402301 is an apocalyptic number.
It is an amenable number.
13044241402301 is a deficient number, since it is larger than the sum of its proper divisors (98248816579).
13044241402301 is a wasteful number, since it uses less digits than its factorization.
13044241402301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19796.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 13044241402301 its reverse (10320414244031), we get a palindrome (23364655646332).
The spelling of 13044241402301 in words is "thirteen trillion, forty-four billion, two hundred forty-one million, four hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •