Base | Representation |
---|---|
bin | 11100101111011010… |
… | …01101000000010101 |
3 | 1110211100110212101222 |
4 | 32113231031000111 |
5 | 223100102030003 |
6 | 11031040500125 |
7 | 1054241532044 |
oct | 162755150025 |
9 | 43740425358 |
10 | 15430111253 |
11 | 65a8993a67 |
12 | 2ba761a645 |
13 | 15bb9a115b |
14 | a653c655b |
15 | 604974c38 |
hex | 397b4d015 |
15430111253 has 4 divisors (see below), whose sum is σ = 15551608320. Its totient is φ = 15308614188.
The previous prime is 15430111243. The next prime is 15430111267. The reversal of 15430111253 is 35211103451.
15430111253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 15430111253 - 222 = 15425916949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15430111243) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 60748343 + ... + 60748596.
It is an arithmetic number, because the mean of its divisors is an integer number (3887902080).
Almost surely, 215430111253 is an apocalyptic number.
It is an amenable number.
15430111253 is a deficient number, since it is larger than the sum of its proper divisors (121497067).
15430111253 is a wasteful number, since it uses less digits than its factorization.
15430111253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121497066.
The product of its (nonzero) digits is 1800, while the sum is 26.
The spelling of 15430111253 in words is "fifteen billion, four hundred thirty million, one hundred eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •