Base | Representation |
---|---|
bin | 1011110111001110100111… |
… | …0110010100111000101111 |
3 | 1201011221102001010121000122 |
4 | 2331303221312110320233 |
5 | 3202200433133341221 |
6 | 43424024145115155 |
7 | 2514233463024653 |
oct | 275635166247057 |
9 | 51157361117018 |
10 | 13043444043311 |
11 | 417976a136520 |
12 | 1567aa7028abb |
13 | 737cb7414816 |
14 | 33143db86a63 |
15 | 1794536c5eab |
hex | bdce9d94e2f |
13043444043311 has 8 divisors (see below), whose sum is σ = 14232762820224. Its totient is φ = 11854717122520.
The previous prime is 13043444043307. The next prime is 13043444043397. The reversal of 13043444043311 is 11334044434031.
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 13043444043311 - 22 = 13043444043307 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13043444043611) 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, 147917945 + ... + 148006098.
It is an arithmetic number, because the mean of its divisors is an integer number (1779095352528).
Almost surely, 213043444043311 is an apocalyptic number.
13043444043311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13043444043311 is a deficient number, since it is larger than the sum of its proper divisors (1189318776913).
13043444043311 is a wasteful number, since it uses less digits than its factorization.
13043444043311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295928061.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 13043444043311 its reverse (11334044434031), we get a palindrome (24377488477342).
The spelling of 13043444043311 in words is "thirteen trillion, forty-three billion, four hundred forty-four million, forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •