Base | Representation |
---|---|
bin | 101111100100010100… |
… | …0100100001110011111 |
3 | 100202200000212011210222 |
4 | 1133020220210032133 |
5 | 3133200440401101 |
6 | 114532135551555 |
7 | 10244244303020 |
oct | 1371050441637 |
9 | 322600764728 |
10 | 102150325151 |
11 | 3a35a217226 |
12 | 17969b2b5bb |
13 | 982c16a9a4 |
14 | 4d3088ac47 |
15 | 29ccde301b |
hex | 17c8a2439f |
102150325151 has 8 divisors (see below), whose sum is σ = 119458187904. Its totient is φ = 85521202200.
The previous prime is 102150325139. The next prime is 102150325159. The reversal of 102150325151 is 151523051201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102150325151 - 222 = 102146130847 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102150325151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102150325159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 169684625 + ... + 169685226.
It is an arithmetic number, because the mean of its divisors is an integer number (14932273488).
Almost surely, 2102150325151 is an apocalyptic number.
102150325151 is a deficient number, since it is larger than the sum of its proper divisors (17307862753).
102150325151 is an equidigital number, since it uses as much as digits as its factorization.
102150325151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339369901.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 102150325151 its reverse (151523051201), we get a palindrome (253673376352).
The spelling of 102150325151 in words is "one hundred two billion, one hundred fifty million, three hundred twenty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •