Base | Representation |
---|---|
bin | 11100001001110000… |
… | …10011000000011001 |
3 | 1110000100010120101201 |
4 | 32010320103000121 |
5 | 221423222033223 |
6 | 10535434514201 |
7 | 1043355011356 |
oct | 160470230031 |
9 | 43010116351 |
10 | 15114252313 |
11 | 6456668516 |
12 | 2b19895961 |
13 | 156b40ca84 |
14 | a3548562d |
15 | 5d6d81ead |
hex | 384e13019 |
15114252313 has 4 divisors (see below), whose sum is σ = 15115475200. Its totient is φ = 15113029428.
The previous prime is 15114252299. The next prime is 15114252319. The reversal of 15114252313 is 31325241151.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31325241151 = 3877 ⋅8079763.
It is a cyclic number.
It is not a de Polignac number, because 15114252313 - 213 = 15114244121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15114252319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 592713 + ... + 617686.
It is an arithmetic number, because the mean of its divisors is an integer number (3778868800).
Almost surely, 215114252313 is an apocalyptic number.
It is an amenable number.
15114252313 is a deficient number, since it is larger than the sum of its proper divisors (1222887).
15114252313 is a wasteful number, since it uses less digits than its factorization.
15114252313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1222886.
The product of its digits is 3600, while the sum is 28.
Adding to 15114252313 its reverse (31325241151), we get a palindrome (46439493464).
The spelling of 15114252313 in words is "fifteen billion, one hundred fourteen million, two hundred fifty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •