Base | Representation |
---|---|
bin | 1001000110000101001010… |
… | …11011111111110011011001 |
3 | 2121210222212101010102002001 |
4 | 10203002211123333303121 |
5 | 10110140243141410131 |
6 | 110311534453441001 |
7 | 4132651124106256 |
oct | 443024533776331 |
9 | 77728771112061 |
10 | 20000143310041 |
11 | 641101654aa94 |
12 | 22b01b3640161 |
13 | b2100bbac88b |
14 | 4d20252c442d |
15 | 24a3b2743261 |
hex | 1230a56ffcd9 |
20000143310041 has 8 divisors (see below), whose sum is σ = 20058908558400. Its totient is φ = 19941395032080.
The previous prime is 20000143310011. The next prime is 20000143310071. The reversal of 20000143310041 is 14001334100002.
It is an interprime number because it is at equal distance from previous prime (20000143310011) and next prime (20000143310071).
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 20000143310041 - 213 = 20000143301849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20000143310011) 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, 1880146 + ... + 6598123.
It is an arithmetic number, because the mean of its divisors is an integer number (2507363569800).
Almost surely, 220000143310041 is an apocalyptic number.
It is an amenable number.
20000143310041 is a deficient number, since it is larger than the sum of its proper divisors (58765248359).
20000143310041 is an equidigital number, since it uses as much as digits as its factorization.
20000143310041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8485199.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20000143310041 its reverse (14001334100002), we get a palindrome (34001477410043).
The spelling of 20000143310041 in words is "twenty trillion, one hundred forty-three million, three hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •