Search a number
-
+
2010031211013 = 37767312474361
BaseRepresentation
bin11101001111111111001…
…100100100001000000101
321010011020112100011112220
4131033333030210020011
5230413020442223023
64135221240402553
7265135306251150
oct35177714441005
97104215304486
102010031211013
117054a4243121
12285683476459
1311771185baa7
146d400c18c97
15374439a33e3
hex1d3ff324205

2010031211013 has 16 divisors (see below), whose sum is σ = 3063304127616. Its totient is φ = 1148439479040.

The previous prime is 2010031210937. The next prime is 2010031211033. The reversal of 2010031211013 is 3101121300102.

It is a happy number.

It is not a de Polignac number, because 2010031211013 - 29 = 2010031210501 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6076048 + ... + 6398313.

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

Almost surely, 22010031211013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 12482044.

The product of its (nonzero) digits is 36, while the sum is 15.

Adding to 2010031211013 its reverse (3101121300102), we get a palindrome (5111152511115).

The spelling of 2010031211013 in words is "two trillion, ten billion, thirty-one million, two hundred eleven thousand, thirteen".

Divisors: 1 3 7 21 7673 23019 53711 161133 12474361 37423083 87320527 261961581 95715771953 287147315859 670010403671 2010031211013