Base | Representation |
---|---|
bin | 11100011000000011… |
… | …01000011111011101 |
3 | 1110022200201111120001 |
4 | 32030001220133131 |
5 | 222144414441000 |
6 | 10555400254301 |
7 | 1046342024461 |
oct | 161401503735 |
9 | 43280644501 |
10 | 15234140125 |
11 | 6508302a56 |
12 | 2b51a71391 |
13 | 158a1c78c9 |
14 | a473724a1 |
15 | 5e266446a |
hex | 38c0687dd |
15234140125 has 32 divisors (see below), whose sum is σ = 19665644544. Its totient is φ = 11770056000.
The previous prime is 15234140083. The next prime is 15234140149. The reversal of 15234140125 is 52104143251.
15234140125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 15234140125 - 27 = 15234139997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15234140093 and 15234140102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2022867 + ... + 2030383.
It is an arithmetic number, because the mean of its divisors is an integer number (614551392).
Almost surely, 215234140125 is an apocalyptic number.
It is an amenable number.
15234140125 is a deficient number, since it is larger than the sum of its proper divisors (4431504419).
15234140125 is an equidigital number, since it uses as much as digits as its factorization.
15234140125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8086 (or 8076 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 15234140125 its reverse (52104143251), we get a palindrome (67338283376).
The spelling of 15234140125 in words is "fifteen billion, two hundred thirty-four million, one hundred forty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •