Base | Representation |
---|---|
bin | 10010101001011110… |
… | …100001011110101101 |
3 | 1220200110012222021222 |
4 | 102221132201132231 |
5 | 312001421021031 |
6 | 13110515033125 |
7 | 1306123364051 |
oct | 225136413655 |
9 | 56613188258 |
10 | 20023220141 |
11 | 8545649721 |
12 | 3a6989b7a5 |
13 | 1b71447972 |
14 | d7d40bc61 |
15 | 7c2d05e7b |
hex | 4a97a17ad |
20023220141 has 4 divisors (see below), whose sum is σ = 20106304284. Its totient is φ = 19940136000.
The previous prime is 20023220131. The next prime is 20023220149. The reversal of 20023220141 is 14102232002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 18665297641 + 1357922500 = 136621^2 + 36850^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20023220141 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 (20023220149) 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, 41541710 + ... + 41542191.
It is an arithmetic number, because the mean of its divisors is an integer number (5026576071).
Almost surely, 220023220141 is an apocalyptic number.
It is an amenable number.
20023220141 is a deficient number, since it is larger than the sum of its proper divisors (83084143).
20023220141 is an equidigital number, since it uses as much as digits as its factorization.
20023220141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83084142.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 20023220141 its reverse (14102232002), we get a palindrome (34125452143).
The spelling of 20023220141 in words is "twenty billion, twenty-three million, two hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •