Base | Representation |
---|---|
bin | 11100001000010011… |
… | …11101001001000011 |
3 | 1102222111021101020001 |
4 | 32010021331021003 |
5 | 221412114313011 |
6 | 10534322300431 |
7 | 1043146524052 |
oct | 160411751103 |
9 | 42874241201 |
10 | 15102104131 |
11 | 644a8203a4 |
12 | 2b157b7717 |
13 | 1568a484ba |
14 | a33a02399 |
15 | 5d5c827c1 |
hex | 38427d243 |
15102104131 has 4 divisors (see below), whose sum is σ = 15102350064. Its totient is φ = 15101858200.
The previous prime is 15102104099. The next prime is 15102104159. The reversal of 15102104131 is 13140120151.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 15102104131 - 25 = 15102104099 is a prime.
It is a super-3 number, since 3×151021041313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15102104099 and 15102104108.
It is not an unprimeable number, because it can be changed into a prime (15102104161) 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, 55026 + ... + 182296.
It is an arithmetic number, because the mean of its divisors is an integer number (3775587516).
Almost surely, 215102104131 is an apocalyptic number.
15102104131 is a deficient number, since it is larger than the sum of its proper divisors (245933).
15102104131 is a wasteful number, since it uses less digits than its factorization.
15102104131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245932.
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 15102104131 its reverse (13140120151), we get a palindrome (28242224282).
The spelling of 15102104131 in words is "fifteen billion, one hundred two million, one hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •