Base | Representation |
---|---|
bin | 10010101111011011… |
… | …101010100001011001 |
3 | 1220221102020010101210 |
4 | 102233123222201121 |
5 | 312203010242131 |
6 | 13124444333333 |
7 | 1311445550163 |
oct | 225733524131 |
9 | 56842203353 |
10 | 20123134041 |
11 | 8596a9149a |
12 | 3a97244249 |
13 | 1b8905b20a |
14 | d8c7b9933 |
15 | 7cb990146 |
hex | 4af6ea859 |
20123134041 has 4 divisors (see below), whose sum is σ = 26830845392. Its totient is φ = 13415422692.
The previous prime is 20123134037. The next prime is 20123134049. The reversal of 20123134041 is 14043132102.
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 20123134041 - 22 = 20123134037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20123133999 and 20123134017.
It is not an unprimeable number, because it can be changed into a prime (20123134049) 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, 3353855671 + ... + 3353855676.
It is an arithmetic number, because the mean of its divisors is an integer number (6707711348).
Almost surely, 220123134041 is an apocalyptic number.
It is an amenable number.
20123134041 is a deficient number, since it is larger than the sum of its proper divisors (6707711351).
20123134041 is an equidigital number, since it uses as much as digits as its factorization.
20123134041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6707711350.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 20123134041 its reverse (14043132102), we get a palindrome (34166266143).
The spelling of 20123134041 in words is "twenty billion, one hundred twenty-three million, one hundred thirty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •