Search a number
-
+
10201111001212 = 229726291523199
BaseRepresentation
bin1001010001110010000110…
…0110001111100001111100
31100010012211222001122110211
42110130201212033201330
52314113333404014322
633410154203442204
72102002016554015
oct224344146174174
940105758048424
1010201111001212
1132832a324393a
121189063526364
1358cc646aa861
14273a449b400c
1512a54abc2b77
hex9472198f87c

10201111001212 has 12 divisors (see below), whose sum is σ = 18035984915200. Its totient is φ = 5047972454016.

The previous prime is 10201111001189. The next prime is 10201111001219. The reversal of 10201111001212 is 21210011110201.

It is a happy number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13145761212 + ... + 13145761987.

Almost surely, 210201111001212 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 26291523300 (or 26291523298 counting only the distinct ones).

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

Adding to 10201111001212 its reverse (21210011110201), we get a palindrome (31411122111413).

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

Divisors: 1 2 4 97 194 388 26291523199 52583046398 105166092796 2550277750303 5100555500606 10201111001212