Search a number
-
+
1011010011002 = 210611399340559
BaseRepresentation
bin11101011011001001110…
…01000111111101111010
310120122121000200221020022
432231210321013331322
5113031022030323002
62052241313130442
7133020525205325
oct16554471077572
93518530627208
101011010011002
1135a848881142
12143b35259a22
13744512b9a54
1436d0c7a17bc
151b473131ba2
hexeb64e47f7a

1011010011002 has 16 divisors (see below), whose sum is σ = 1519033824000. Its totient is φ = 504666089040.

The previous prime is 1011010011001. The next prime is 1011010011031. The reversal of 1011010011002 is 2001100101101.

It is a happy number.

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

It is not an unprimeable number, because it can be changed into a prime (1011010011001) 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, 2798399 + ... + 3138957.

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

Almost surely, 21011010011002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 343021.

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 1011010011002 its reverse (2001100101101), we get a palindrome (3012110112103).

Subtracting 1011010011002 from its reverse (2001100101101), we obtain a palindrome (990090090099).

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

Divisors: 1 2 1061 1399 2122 2798 340559 681118 1484339 2968678 361333099 476442041 722666198 952884082 505505005501 1011010011002