Base | Representation |
---|---|
bin | 11100000000101011… |
… | …10100101100101101 |
3 | 1102211000211221212012 |
4 | 32000111310230231 |
5 | 221244223401123 |
6 | 10524114451005 |
7 | 1041441536561 |
oct | 160025645455 |
9 | 42730757765 |
10 | 15038106413 |
11 | 6417689a20 |
12 | 2ab8293a65 |
13 | 15586cba25 |
14 | a293036a1 |
15 | 5d0340378 |
hex | 380574b2d |
15038106413 has 8 divisors (see below), whose sum is σ = 16406283456. Its totient is φ = 13670108800.
The previous prime is 15038106401. The next prime is 15038106431. The reversal of 15038106413 is 31460183051.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15038106413 is a prime.
It is a super-2 number, since 2×150381064132 (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 15038106413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15038136413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 178973 + ... + 249213.
It is an arithmetic number, because the mean of its divisors is an integer number (2050785432).
Almost surely, 215038106413 is an apocalyptic number.
It is an amenable number.
15038106413 is a deficient number, since it is larger than the sum of its proper divisors (1368177043).
15038106413 is a wasteful number, since it uses less digits than its factorization.
15038106413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89715.
The product of its (nonzero) digits is 8640, while the sum is 32.
Adding to 15038106413 its reverse (31460183051), we get a palindrome (46498289464).
The spelling of 15038106413 in words is "fifteen billion, thirty-eight million, one hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •