Base | Representation |
---|---|
bin | 1101110100111000011000… |
… | …1101111001100111000011 |
3 | 1222211022101100101202000102 |
4 | 3131032012031321213003 |
5 | 3443032441102120311 |
6 | 52155433413513015 |
7 | 3126214140604553 |
oct | 335160615714703 |
9 | 58738340352012 |
10 | 15202141051331 |
11 | 4931212339293 |
12 | 185633a34276b |
13 | 86372bca0a20 |
14 | 3a7b0508b163 |
15 | 1b5698a5e43b |
hex | dd3863799c3 |
15202141051331 has 32 divisors (see below), whose sum is σ = 17122468841856. Its totient is φ = 13403864448000.
The previous prime is 15202141051303. The next prime is 15202141051337. The reversal of 15202141051331 is 13315014120251.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-15202141051331 is a prime.
It is a super-2 number, since 2×152021410513312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15202141051294 and 15202141051303.
It is not an unprimeable number, because it can be changed into a prime (15202141051337) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14789426 + ... + 15783896.
It is an arithmetic number, because the mean of its divisors is an integer number (535077151308).
Almost surely, 215202141051331 is an apocalyptic number.
15202141051331 is a deficient number, since it is larger than the sum of its proper divisors (1920327790525).
15202141051331 is a wasteful number, since it uses less digits than its factorization.
15202141051331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 995103.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 15202141051331 its reverse (13315014120251), we get a palindrome (28517155171582).
The spelling of 15202141051331 in words is "fifteen trillion, two hundred two billion, one hundred forty-one million, fifty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •