Base | Representation |
---|---|
bin | 11100000001100000… |
… | …01011011001011011 |
3 | 1102211111211221211122 |
4 | 32000300023121123 |
5 | 221303010441011 |
6 | 10524522515455 |
7 | 1041554342606 |
oct | 160060133133 |
9 | 42744757748 |
10 | 15045015131 |
11 | 6420578603 |
12 | 2aba665b8b |
13 | 1559c7a523 |
14 | a2a1c133d |
15 | 5d0c573db |
hex | 380c0b65b |
15045015131 has 4 divisors (see below), whose sum is σ = 15100532064. Its totient is φ = 14989498200.
The previous prime is 15045015127. The next prime is 15045015143. The reversal of 15045015131 is 13151054051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13151054051 = 2221 ⋅5921231.
It is a cyclic number.
It is not a de Polignac number, because 15045015131 - 22 = 15045015127 is a prime.
It is a super-2 number, since 2×150450151312 (a number of 21 digits) contains 22 as substring.
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 15045015131.
It is not an unprimeable number, because it can be changed into a prime (15045015101) 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, 27758060 + ... + 27758601.
It is an arithmetic number, because the mean of its divisors is an integer number (3775133016).
Almost surely, 215045015131 is an apocalyptic number.
15045015131 is a deficient number, since it is larger than the sum of its proper divisors (55516933).
15045015131 is an equidigital number, since it uses as much as digits as its factorization.
15045015131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55516932.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 15045015131 its reverse (13151054051), we get a palindrome (28196069182).
The spelling of 15045015131 in words is "fifteen billion, forty-five million, fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •