Search a number
-
+
146010009101 = 11431631893799
BaseRepresentation
bin1000011111111011011…
…1111110111000001101
3111221212200120222022212
42013332313332320031
54343012030242401
6151024233120205
713356156412505
oct2077667767015
9457780528285
10146010009101
1156a16930a10
122436a559065
13109cba537b8
1470d18c4a05
153be8684dbb
hex21fedfee0d

146010009101 has 16 divisors (see below), whose sum is σ = 163987929600. Its totient is φ = 128854015920.

The previous prime is 146010009091. The next prime is 146010009113. The reversal of 146010009101 is 101900010641.

It is a cyclic number.

It is not a de Polignac number, because 146010009101 - 218 = 146009746957 is a prime.

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 869801 + ... + 1023998.

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

Almost surely, 2146010009101 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 1894016.

The product of its (nonzero) digits is 216, while the sum is 23.

Adding to 146010009101 its reverse (101900010641), we get a palindrome (247910019742).

The spelling of 146010009101 in words is "one hundred forty-six billion, ten million, nine thousand, one hundred one".

Divisors: 1 11 43 163 473 1793 7009 77099 1893799 20831789 81433357 308689237 895766927 3395581607 13273637191 146010009101