Search a number
-
+
101120002010 = 2510112000201
BaseRepresentation
bin101111000101100111…
…0001100011111011010
3100200000020010100011122
41132023032030133122
53124043210031020
6114242012325242
710206563556326
oct1361316143732
9320006110148
10101120002010
11399806721a5
1217720a73822
1396c6874721
144c73ac8986
15296c722125
hex178b38c7da

101120002010 has 8 divisors (see below), whose sum is σ = 182016003636. Its totient is φ = 40448000800.

The previous prime is 101120002003. The next prime is 101120002013. The reversal of 101120002010 is 10200021101.

It can be written as a sum of positive squares in 2 ways, for example, as 96834859489 + 4285142521 = 311183^2 + 65461^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

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

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

Almost surely, 2101120002010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10112000208.

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

Adding to 101120002010 its reverse (10200021101), we get a palindrome (111320023111).

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

Divisors: 1 2 5 10 10112000201 20224000402 50560001005 101120002010