Search a number
-
+
1011012110210 = 25234395704827
BaseRepresentation
bin11101011011001010000…
…01001000011110000010
310120122121011122120210202
432231211001020132002
5113031023100011320
62052241430125202
7133020552100424
oct16554501103602
93518534576722
101011012110210
1135a849a85323
12143b35ab0802
137445187339b
1436d0cb8a814
151b4733e8b75
hexeb65048782

1011012110210 has 16 divisors (see below), whose sum is σ = 1898944485696. Its totient is φ = 386822024688.

The previous prime is 1011012110209. The next prime is 1011012110231. The reversal of 1011012110210 is 120112101101.

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

It is an unprimeable number.

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, 2197852184 + ... + 2197852643.

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

Almost surely, 21011012110210 is an apocalyptic number.

1011012110210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 4395704857.

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 1011012110210 its reverse (120112101101), we get a palindrome (1131124211311).

The spelling of 1011012110210 in words is "one trillion, eleven billion, twelve million, one hundred ten thousand, two hundred ten".

Divisors: 1 2 5 10 23 46 115 230 4395704827 8791409654 21978524135 43957048270 101101211021 202202422042 505506055105 1011012110210