Base | Representation |
---|---|
bin | 10010111011111001… |
… | …001110100001111101 |
3 | 1221110222122022002222 |
4 | 102323321032201331 |
5 | 313120021212201 |
6 | 13201313455125 |
7 | 1316564636024 |
oct | 227371164175 |
9 | 57428568088 |
10 | 20332210301 |
11 | 8694003597 |
12 | 3b352714a5 |
13 | 1bc0472790 |
14 | dac4818bb |
15 | 7deedd91b |
hex | 4bbe4e87d |
20332210301 has 4 divisors (see below), whose sum is σ = 21896226492. Its totient is φ = 18768194112.
The previous prime is 20332210267. The next prime is 20332210309. The reversal of 20332210301 is 10301223302.
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 3288907801 + 17043302500 = 57349^2 + 130550^2 .
It is a cyclic number.
It is not a de Polignac number, because 20332210301 - 234 = 3152341117 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 20332210301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20332210309) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 782008076 + ... + 782008101.
It is an arithmetic number, because the mean of its divisors is an integer number (5474056623).
Almost surely, 220332210301 is an apocalyptic number.
It is an amenable number.
20332210301 is a deficient number, since it is larger than the sum of its proper divisors (1564016191).
20332210301 is a wasteful number, since it uses less digits than its factorization.
20332210301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1564016190.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 20332210301 its reverse (10301223302), we get a palindrome (30633433603).
The spelling of 20332210301 in words is "twenty billion, three hundred thirty-two million, two hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •