Search a number
-
+
2010215063131 = 11408911446911
BaseRepresentation
bin11101010000001010001…
…001111001111001011011
321010011201100021211020121
4131100022021321321123
5230413410024010011
64135251405134111
7265143001052152
oct35201211717133
97104640254217
102010215063131
11705588aa6a20
12285714b5a337
13117740981122
146d41b3d6599
1537454bbce71
hex1d40a279e5b

2010215063131 has 8 divisors (see below), whose sum is σ = 2192972156928. Its totient is φ = 1827459681000.

The previous prime is 2010215063111. The next prime is 2010215063179. The reversal of 2010215063131 is 1313605120102.

It is a happy number.

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 2010215063131 - 221 = 2010212965979 is a prime.

It is a super-2 number, since 2×20102150631312 (a number of 25 digits) contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 2010215063096 and 2010215063105.

It is not an unprimeable number, because it can be changed into a prime (2010215063111) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4274566 + ... + 4721476.

It is an arithmetic number, because the mean of its divisors is an integer number (274121519616).

Almost surely, 22010215063131 is an apocalyptic number.

2010215063131 is a deficient number, since it is larger than the sum of its proper divisors (182757093797).

2010215063131 is a wasteful number, since it uses less digits than its factorization.

2010215063131 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 855833.

The product of its (nonzero) digits is 1080, while the sum is 25.

The spelling of 2010215063131 in words is "two trillion, ten billion, two hundred fifteen million, sixty-three thousand, one hundred thirty-one".

Divisors: 1 11 408911 446911 4498021 4916021 182746823921 2010215063131