Base | Representation |
---|---|
bin | 1100001110011101011… |
… | …1000010011010011101 |
3 | 202002011001022211221122 |
4 | 3003213113002122131 |
5 | 11420130220200201 |
6 | 240254022140325 |
7 | 21113662411256 |
oct | 3034727023235 |
9 | 662131284848 |
10 | 210040006301 |
11 | 81094120574 |
12 | 34859b816a5 |
13 | 16a643a5cc8 |
14 | a247699b2d |
15 | 56e4ad5e1b |
hex | 30e75c269d |
210040006301 has 4 divisors (see below), whose sum is σ = 219172180512. Its totient is φ = 200907832092.
The previous prime is 210040006261. The next prime is 210040006307. The reversal of 210040006301 is 103600040012.
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 210040006301 - 210 = 210040005277 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 210040006301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210040006307) 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, 4566087071 + ... + 4566087116.
It is an arithmetic number, because the mean of its divisors is an integer number (54793045128).
Almost surely, 2210040006301 is an apocalyptic number.
It is an amenable number.
210040006301 is a deficient number, since it is larger than the sum of its proper divisors (9132174211).
210040006301 is an equidigital number, since it uses as much as digits as its factorization.
210040006301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9132174210.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 210040006301 its reverse (103600040012), we get a palindrome (313640046313).
The spelling of 210040006301 in words is "two hundred ten billion, forty million, six thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •