Search a number
-
+
10000201100002 = 2231911138197257
BaseRepresentation
bin1001000110000101101001…
…1011110010101011100010
31022102000021012122012011121
42101201122123302223202
52302320402440200002
633134010131202454
72051330206562551
oct221413233625342
938360235565147
1010000201100002
1132060748a8473
12115613314642a
13577026a093c9
14268025b19d98
151251dc918237
hex9185a6f2ae2

10000201100002 has 16 divisors (see below), whose sum is σ = 15734438894592. Its totient is φ = 4757664530080.

The previous prime is 10000201099961. The next prime is 10000201100003. The reversal of 10000201100002 is 20000110200001.

It is a super-3 number, since 3×100002011000023 (a number of 40 digits) contains 333 as substring.

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

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

Almost surely, 210000201100002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1138197473.

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

Adding to 10000201100002 its reverse (20000110200001), we get a palindrome (30000311300003).

Subtracting 10000201100002 from its reverse (20000110200001), we obtain a palindrome (9999909099999).

The spelling of 10000201100002 in words is "ten trillion, two hundred one million, one hundred thousand, two".

Divisors: 1 2 23 46 191 382 4393 8786 1138197257 2276394514 26178536911 52357073822 217395676087 434791352174 5000100550001 10000201100002