Base | Representation |
---|---|
bin | 11100001100101101… |
… | …10001001110000001 |
3 | 1110002001201202222121 |
4 | 32012112301032001 |
5 | 222001042030401 |
6 | 10542121404241 |
7 | 1044105345361 |
oct | 160626611601 |
9 | 43061652877 |
10 | 15139017601 |
11 | 6469642aa4 |
12 | 2b26039681 |
13 | 15735a11a6 |
14 | a388909a1 |
15 | 5d9124ca1 |
hex | 3865b1381 |
15139017601 has 4 divisors (see below), whose sum is σ = 15258222592. Its totient is φ = 15019812612.
The previous prime is 15139017589. The next prime is 15139017613. The reversal of 15139017601 is 10671093151.
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.
It is an interprime number because it is at equal distance from previous prime (15139017589) and next prime (15139017613).
It is a cyclic number.
It is not a de Polignac number, because 15139017601 - 213 = 15139009409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15139017401) 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, 59602305 + ... + 59602558.
It is an arithmetic number, because the mean of its divisors is an integer number (3814555648).
Almost surely, 215139017601 is an apocalyptic number.
It is an amenable number.
15139017601 is a deficient number, since it is larger than the sum of its proper divisors (119204991).
15139017601 is a wasteful number, since it uses less digits than its factorization.
15139017601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119204990.
The product of its (nonzero) digits is 5670, while the sum is 34.
The spelling of 15139017601 in words is "fifteen billion, one hundred thirty-nine million, seventeen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •