Base | Representation |
---|---|
bin | 1101101001111001010001… |
… | …1000001000000100101011 |
3 | 1222011021012122220112220012 |
4 | 3122132110120020010223 |
5 | 3431434420403131021 |
6 | 51533021043122135 |
7 | 3106453022563454 |
oct | 332362430100453 |
9 | 58137178815805 |
10 | 15013400052011 |
11 | 4869168a26a29 |
12 | 182584537334b |
13 | 84b9b045063a |
14 | 39c91c41a12b |
15 | 1b07edc8a35b |
hex | da79460812b |
15013400052011 has 4 divisors (see below), whose sum is σ = 15013419126000. Its totient is φ = 15013380978024.
The previous prime is 15013400051989. The next prime is 15013400052029. The reversal of 15013400052011 is 11025000431051.
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 15013400052011 - 242 = 10615353540907 is a prime.
It is a super-2 number, since 2×150134000520112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15013400052041) 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, 8303111 + ... + 9948288.
It is an arithmetic number, because the mean of its divisors is an integer number (3753354781500).
Almost surely, 215013400052011 is an apocalyptic number.
15013400052011 is a deficient number, since it is larger than the sum of its proper divisors (19073989).
15013400052011 is an equidigital number, since it uses as much as digits as its factorization.
15013400052011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19073988.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 15013400052011 its reverse (11025000431051), we get a palindrome (26038400483062).
The spelling of 15013400052011 in words is "fifteen trillion, thirteen billion, four hundred million, fifty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •