Base | Representation |
---|---|
bin | 100000000011010011110… |
… | …1100110001101001000111 |
3 | 120121010110211022202210121 |
4 | 1000012213230301221013 |
5 | 1034133224140324033 |
6 | 13211411132002411 |
7 | 633155563532125 |
oct | 100064754615107 |
9 | 16533424282717 |
10 | 4405155011143 |
11 | 1449241186157 |
12 | 5b18b9600407 |
13 | 25c53442a413 |
14 | 1132d3dd4915 |
15 | 798c522962d |
hex | 401a7b31a47 |
4405155011143 has 4 divisors (see below), whose sum is σ = 4547256785728. Its totient is φ = 4263053236560.
The previous prime is 4405155011129. The next prime is 4405155011149. The reversal of 4405155011143 is 3411105515044.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4405155011143 - 29 = 4405155010631 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4405155011099 and 4405155011108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4405155011149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71050887246 + ... + 71050887307.
It is an arithmetic number, because the mean of its divisors is an integer number (1136814196432).
Almost surely, 24405155011143 is an apocalyptic number.
4405155011143 is a deficient number, since it is larger than the sum of its proper divisors (142101774585).
4405155011143 is a wasteful number, since it uses less digits than its factorization.
4405155011143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142101774584.
The product of its (nonzero) digits is 24000, while the sum is 34.
The spelling of 4405155011143 in words is "four trillion, four hundred five billion, one hundred fifty-five million, eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •