Base | Representation |
---|---|
bin | 111100100001110… |
… | …1100110010011101 |
3 | 12020112201011002111 |
4 | 1321003230302131 |
5 | 13124414404041 |
6 | 533311354021 |
7 | 101221216522 |
oct | 17103546235 |
9 | 5215634074 |
10 | 2031013021 |
11 | 9524aa164 |
12 | 488222911 |
13 | 264a1546b |
14 | 153a4d149 |
15 | bd48b981 |
hex | 790ecc9d |
2031013021 has 8 divisors (see below), whose sum is σ = 2080508544. Its totient is φ = 1981779360.
The previous prime is 2031013013. The next prime is 2031013027. The reversal of 2031013021 is 1203101302.
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 2031013021 - 23 = 2031013013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2031012992 and 2031013010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2031013027) 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, 49720 + ... + 80833.
It is an arithmetic number, because the mean of its divisors is an integer number (260063568).
Almost surely, 22031013021 is an apocalyptic number.
It is an amenable number.
2031013021 is a deficient number, since it is larger than the sum of its proper divisors (49495523).
2031013021 is a wasteful number, since it uses less digits than its factorization.
2031013021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130931.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 2031013021 is about 45066.7618206589. The cubic root of 2031013021 is about 1266.4000020901.
Adding to 2031013021 its reverse (1203101302), we get a palindrome (3234114323).
The spelling of 2031013021 in words is "two billion, thirty-one million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •