Base | Representation |
---|---|
bin | 11101010000000011011… |
… | …010101100001101110111 |
3 | 21010011102110120210101020 |
4 | 131100003122230031313 |
5 | 230413142104214111 |
6 | 4135232250232223 |
7 | 265140126166164 |
oct | 35200332541567 |
9 | 7104373523336 |
10 | 2010102023031 |
11 | 705530209253 |
12 | 2856a3125673 |
13 | 1177234230ab |
14 | 6d40a3ad06b |
15 | 37449cde906 |
hex | 1d4036ac377 |
2010102023031 has 4 divisors (see below), whose sum is σ = 2680136030712. Its totient is φ = 1340068015352.
The previous prime is 2010102022891. The next prime is 2010102023053. The reversal of 2010102023031 is 1303202010102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2010102023031 - 210 = 2010102022007 is a prime.
It is a super-2 number, since 2×20101020230312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2010102023031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010102023081) 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, 335017003836 + ... + 335017003841.
It is an arithmetic number, because the mean of its divisors is an integer number (670034007678).
Almost surely, 22010102023031 is an apocalyptic number.
2010102023031 is a deficient number, since it is larger than the sum of its proper divisors (670034007681).
2010102023031 is an equidigital number, since it uses as much as digits as its factorization.
2010102023031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670034007680.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2010102023031 its reverse (1303202010102), we get a palindrome (3313304033133).
The spelling of 2010102023031 in words is "two trillion, ten billion, one hundred two million, twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •