Search a number
-
+
101020120010 = 2518155812221
BaseRepresentation
bin101111000010101000…
…1001011001111001010
3100122202021011210211022
41132011101023033022
53123342122320020
6114224043432442
710204241565215
oct1360521131712
9318667153738
10101020120010
113992a251397
12176b3525722
1396abc72854
144c6472877c
152963a92625
hex178544b3ca

101020120010 has 16 divisors (see below), whose sum is σ = 182840839272. Its totient is φ = 40184798400.

The previous prime is 101020119979. The next prime is 101020120027. The reversal of 101020120010 is 10021020101.

It can be written as a sum of positive squares in 4 ways, for example, as 54052995049 + 46967124961 = 232493^2 + 216719^2 .

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 101020120010.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27904301 + ... + 27907920.

Almost surely, 2101020120010 is an apocalyptic number.

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

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

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

101020120010 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 55812409.

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

Adding to 101020120010 its reverse (10021020101), we get a palindrome (111041140111).

Subtracting from 101020120010 its reverse (10021020101), we obtain a palindrome (90999099909).

The spelling of 101020120010 in words is "one hundred one billion, twenty million, one hundred twenty thousand, ten".

Divisors: 1 2 5 10 181 362 905 1810 55812221 111624442 279061105 558122210 10102012001 20204024002 50510060005 101020120010