Base | Representation |
---|---|
bin | 10010110100000010… |
… | …000111000000010001 |
3 | 1221010210110122001120 |
4 | 102310002013000101 |
5 | 312332240233131 |
6 | 13140242552453 |
7 | 1313403616155 |
oct | 226402070021 |
9 | 57123418046 |
10 | 20200321041 |
11 | 86266111aa |
12 | 3ab9068729 |
13 | 1b9c0450b4 |
14 | d98b4d065 |
15 | 7d363a496 |
hex | 4b4087011 |
20200321041 has 4 divisors (see below), whose sum is σ = 26933761392. Its totient is φ = 13466880692.
The previous prime is 20200321033. The next prime is 20200321073. The reversal of 20200321041 is 14012300202.
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 a cyclic number.
It is not a de Polignac number, because 20200321041 - 23 = 20200321033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20200321041.
It is not an unprimeable number, because it can be changed into a prime (20200321441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3366720171 + ... + 3366720176.
It is an arithmetic number, because the mean of its divisors is an integer number (6733440348).
Almost surely, 220200321041 is an apocalyptic number.
It is an amenable number.
20200321041 is a deficient number, since it is larger than the sum of its proper divisors (6733440351).
20200321041 is an equidigital number, since it uses as much as digits as its factorization.
20200321041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6733440350.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 20200321041 its reverse (14012300202), we get a palindrome (34212621243).
The spelling of 20200321041 in words is "twenty billion, two hundred million, three hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •