Base | Representation |
---|---|
bin | 10011000001010100… |
… | …111010101010011011 |
3 | 1221201100010221011212 |
4 | 103001110322222123 |
5 | 313311334330120 |
6 | 13214331213335 |
7 | 1322052440066 |
oct | 230124725233 |
9 | 57640127155 |
10 | 20423355035 |
11 | 87304a6a16 |
12 | 3b5b8a724b |
13 | 1c06305785 |
14 | dba6098dd |
15 | 7e7ee46c5 |
hex | 4c153aa9b |
20423355035 has 8 divisors (see below), whose sum is σ = 25077980400. Its totient is φ = 15958714464.
The previous prime is 20423355031. The next prime is 20423355047. The reversal of 20423355035 is 53055332402.
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 20423355035 - 22 = 20423355031 is a prime.
It is a super-2 number, since 2×204233550352 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20423354992 and 20423355010.
It is not an unprimeable number, because it can be changed into a prime (20423355031) 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 7 ways as a sum of consecutive naturals, for example, 47495960 + ... + 47496389.
It is an arithmetic number, because the mean of its divisors is an integer number (3134747550).
Almost surely, 220423355035 is an apocalyptic number.
20423355035 is a deficient number, since it is larger than the sum of its proper divisors (4654625365).
20423355035 is an equidigital number, since it uses as much as digits as its factorization.
20423355035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94992397.
The product of its (nonzero) digits is 54000, while the sum is 32.
Adding to 20423355035 its reverse (53055332402), we get a palindrome (73478687437).
The spelling of 20423355035 in words is "twenty billion, four hundred twenty-three million, three hundred fifty-five thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •