Search a number
-
+
101300146151 = 109929359139
BaseRepresentation
bin101111001010111110…
…1011000111111100111
3100200110210002121110212
41132111331120333213
53124430314134101
6114311525410035
710214212015031
oct1362575307747
9320423077425
10101300146151
1139a63323156
121777126991b
139724c990a9
144c8d9bcc51
15297d4581bb
hex1795f58fe7

101300146151 has 4 divisors (see below), whose sum is σ = 102229505400. Its totient is φ = 100370786904.

The previous prime is 101300146109. The next prime is 101300146231. The reversal of 101300146151 is 151641003101.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101300146151 is a prime.

It is a super-2 number, since 2×1013001461512 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2101300146151 is an apocalyptic number.

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

101300146151 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 929359248.

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

Adding to 101300146151 its reverse (151641003101), we get a palindrome (252941149252).

The spelling of 101300146151 in words is "one hundred one billion, three hundred million, one hundred forty-six thousand, one hundred fifty-one".

Divisors: 1 109 929359139 101300146151