Base | Representation |
---|---|
bin | 100000010100111111101… |
… | …1100010100001110111101 |
3 | 120201202111200002020010010 |
4 | 1000221333130110032331 |
5 | 1040244014341012110 |
6 | 13241051524133433 |
7 | 636002003344644 |
oct | 100517734241675 |
9 | 16652450066103 |
10 | 4443134313405 |
11 | 1463360540067 |
12 | 5b9138837279 |
13 | 262ca7969738 |
14 | 11509807a35b |
15 | 7a899611020 |
hex | 40a7f7143bd |
4443134313405 has 32 divisors (see below), whose sum is σ = 7593804618624. Its totient is φ = 2210542186496.
The previous prime is 4443134313403. The next prime is 4443134313427. The reversal of 4443134313405 is 5043134313444.
It is a cyclic number.
It is not a de Polignac number, because 4443134313405 - 21 = 4443134313403 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4443134313403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 77068779 + ... + 77126408.
It is an arithmetic number, because the mean of its divisors is an integer number (237306394332).
Almost surely, 24443134313405 is an apocalyptic number.
It is an amenable number.
4443134313405 is a deficient number, since it is larger than the sum of its proper divisors (3150670305219).
4443134313405 is a wasteful number, since it uses less digits than its factorization.
4443134313405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154195325.
The product of its (nonzero) digits is 414720, while the sum is 39.
Adding to 4443134313405 its sum of digits (39), we get a palindrome (4443134313444).
Adding to 4443134313405 its reverse (5043134313444), we get a palindrome (9486268626849).
The spelling of 4443134313405 in words is "four trillion, four hundred forty-three billion, one hundred thirty-four million, three hundred thirteen thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •