Base | Representation |
---|---|
bin | 111100101010000… |
… | …1111101000000101 |
3 | 12020211212111100010 |
4 | 1321110033220011 |
5 | 13132022200041 |
6 | 533544340433 |
7 | 101303122035 |
oct | 17124175005 |
9 | 5224774303 |
10 | 2035350021 |
11 | 9549a1661 |
12 | 489774719 |
13 | 2658a3533 |
14 | 15445b8c5 |
15 | bda46a16 |
hex | 7950fa05 |
2035350021 has 4 divisors (see below), whose sum is σ = 2713800032. Its totient is φ = 1356900012.
The previous prime is 2035350019. The next prime is 2035350029. The reversal of 2035350021 is 1200535302.
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 2035350021 - 21 = 2035350019 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 2035350021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2035350029) 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, 339225001 + ... + 339225006.
It is an arithmetic number, because the mean of its divisors is an integer number (678450008).
Almost surely, 22035350021 is an apocalyptic number.
It is an amenable number.
2035350021 is a deficient number, since it is larger than the sum of its proper divisors (678450011).
2035350021 is an equidigital number, since it uses as much as digits as its factorization.
2035350021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 678450010.
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 2035350021 is about 45114.8536626242. The cubic root of 2035350021 is about 1267.3007795071.
Adding to 2035350021 its reverse (1200535302), we get a palindrome (3235885323).
The spelling of 2035350021 in words is "two billion, thirty-five million, three hundred fifty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •