Base | Representation |
---|---|
bin | 1000010111000010011… |
… | …1100000101010000101 |
3 | 111201201100121221002002 |
4 | 2011300213200222011 |
5 | 4323120032420331 |
6 | 145551334155045 |
7 | 13243056062645 |
oct | 2056047405205 |
9 | 451640557062 |
10 | 143623326341 |
11 | 55a01694920 |
12 | 23a031b2a85 |
13 | 1070b44b591 |
14 | 6d46930525 |
15 | 3b08d8e9cb |
hex | 21709e0a85 |
143623326341 has 16 divisors (see below), whose sum is σ = 164941056000. Its totient is φ = 123683670000.
The previous prime is 143623326323. The next prime is 143623326347.
143623326341 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 143623326341 - 214 = 143623309957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143623326295 and 143623326304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143623326347) 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, 3048716 + ... + 3095466.
It is an arithmetic number, because the mean of its divisors is an integer number (10308816000).
Almost surely, 2143623326341 is an apocalyptic number.
143623326341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
143623326341 is a deficient number, since it is larger than the sum of its proper divisors (21317729659).
143623326341 is a wasteful number, since it uses less digits than its factorization.
143623326341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61480.
The product of its digits is 186624, while the sum is 38.
It can be divided in two parts, 143623 and 326341, that added together give a palindrome (469964).
The spelling of 143623326341 in words is "one hundred forty-three billion, six hundred twenty-three million, three hundred twenty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •