Base | Representation |
---|---|
bin | 11100100100110010… |
… | …11101110010010111 |
3 | 1110121010220010202020 |
4 | 32102121131302113 |
5 | 222404302113111 |
6 | 11014135544223 |
7 | 1052110532205 |
oct | 162231356227 |
9 | 43533803666 |
10 | 15341051031 |
11 | 6562694779 |
12 | 2b8182b073 |
13 | 15a63babb7 |
14 | a57642075 |
15 | 5ebc31906 |
hex | 39265dc97 |
15341051031 has 4 divisors (see below), whose sum is σ = 20454734712. Its totient is φ = 10227367352.
The previous prime is 15341051021. The next prime is 15341051051. The reversal of 15341051031 is 13015014351.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 15341051031 - 25 = 15341050999 is a prime.
It is a super-2 number, since 2×153410510312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15341050992 and 15341051010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15341051021) 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 3 ways as a sum of consecutive naturals, for example, 2556841836 + ... + 2556841841.
It is an arithmetic number, because the mean of its divisors is an integer number (5113683678).
Almost surely, 215341051031 is an apocalyptic number.
15341051031 is a deficient number, since it is larger than the sum of its proper divisors (5113683681).
15341051031 is an equidigital number, since it uses as much as digits as its factorization.
15341051031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5113683680.
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 15341051031 its reverse (13015014351), we get a palindrome (28356065382).
The spelling of 15341051031 in words is "fifteen billion, three hundred forty-one million, fifty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •