Base | Representation |
---|---|
bin | 1011110111010001100101… |
… | …0111101100100001010111 |
3 | 1201012000110121100110001202 |
4 | 2331310121113230201113 |
5 | 3202204101234220043 |
6 | 43424235225343115 |
7 | 2514262313536604 |
oct | 275643127544127 |
9 | 51160417313052 |
10 | 13044241320023 |
11 | 417a0391872a1 |
12 | 156808a037a9b |
13 | 7380b3652ca4 |
14 | 3314b7a036ab |
15 | 17949d6b11b8 |
hex | bdd195ec857 |
13044241320023 has 8 divisors (see below), whose sum is σ = 13097785118880. Its totient is φ = 12990743943840.
The previous prime is 13044241320007. The next prime is 13044241320037. The reversal of 13044241320023 is 32002314244031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13044241320023 - 24 = 13044241320007 is a prime.
It is a super-2 number, since 2×130442413200232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13044241320083) 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, 11042483 + ... + 12166548.
It is an arithmetic number, because the mean of its divisors is an integer number (1637223139860).
Almost surely, 213044241320023 is an apocalyptic number.
13044241320023 is a deficient number, since it is larger than the sum of its proper divisors (53543798857).
13044241320023 is a wasteful number, since it uses less digits than its factorization.
13044241320023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23211337.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 13044241320023 its reverse (32002314244031), we get a palindrome (45046555564054).
The spelling of 13044241320023 in words is "thirteen trillion, forty-four billion, two hundred forty-one million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •