Base | Representation |
---|---|
bin | 10011001101001110… |
… | …101101001100100001 |
3 | 1222020020220200010001 |
4 | 103031032231030201 |
5 | 314214000203401 |
6 | 13250223340001 |
7 | 1330026030463 |
oct | 231516551441 |
9 | 58206820101 |
10 | 20623053601 |
11 | 88231a3457 |
12 | 3bb6751601 |
13 | 1c387b57c7 |
14 | dd8d50133 |
15 | 80a7de601 |
hex | 4cd3ad321 |
20623053601 has 4 divisors (see below), whose sum is σ = 20653516692. Its totient is φ = 20592590512.
The previous prime is 20623053551. The next prime is 20623053631. The reversal of 20623053601 is 10635032602.
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 13571085025 + 7051968576 = 116495^2 + 83976^2 .
It is a cyclic number.
It is not a de Polignac number, because 20623053601 - 221 = 20620956449 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20623053601.
It is not an unprimeable number, because it can be changed into a prime (20623053631) 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, 15230530 + ... + 15231883.
It is an arithmetic number, because the mean of its divisors is an integer number (5163379173).
Almost surely, 220623053601 is an apocalyptic number.
It is an amenable number.
20623053601 is a deficient number, since it is larger than the sum of its proper divisors (30463091).
20623053601 is an equidigital number, since it uses as much as digits as its factorization.
20623053601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30463090.
The product of its (nonzero) digits is 6480, while the sum is 28.
The spelling of 20623053601 in words is "twenty billion, six hundred twenty-three million, fifty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •