Base | Representation |
---|---|
bin | 10010110101011001… |
… | …100010101101010001 |
3 | 1221012101121002101110 |
4 | 102311121202231101 |
5 | 312404122203131 |
6 | 13142422123533 |
7 | 1314102466263 |
oct | 226531425521 |
9 | 57171532343 |
10 | 20223241041 |
11 | 8638546353 |
12 | 3b048805a9 |
13 | 1ba3a0b623 |
14 | d9bbd7b33 |
15 | 7d5666646 |
hex | 4b5662b51 |
20223241041 has 4 divisors (see below), whose sum is σ = 26964321392. Its totient is φ = 13482160692.
The previous prime is 20223241019. The next prime is 20223241043. The reversal of 20223241041 is 14014232202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 20223241041 - 213 = 20223232849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20223240999 and 20223241017.
It is not an unprimeable number, because it can be changed into a prime (20223241043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3370540171 + ... + 3370540176.
It is an arithmetic number, because the mean of its divisors is an integer number (6741080348).
Almost surely, 220223241041 is an apocalyptic number.
It is an amenable number.
20223241041 is a deficient number, since it is larger than the sum of its proper divisors (6741080351).
20223241041 is an equidigital number, since it uses as much as digits as its factorization.
20223241041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6741080350.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 20223241041 its reverse (14014232202), we get a palindrome (34237473243).
The spelling of 20223241041 in words is "twenty billion, two hundred twenty-three million, two hundred forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •