Base | Representation |
---|---|
bin | 1101101100000101110001… |
… | …1011000011101101011101 |
3 | 1222021212120011010100000001 |
4 | 3123001130123003231131 |
5 | 3433044141144032031 |
6 | 52002215350534301 |
7 | 3112256454063652 |
oct | 333013433035535 |
9 | 58255504110001 |
10 | 15051116002141 |
11 | 488316266854a |
12 | 1831010367391 |
13 | 8524112539ab |
14 | 3a069950bc29 |
15 | 1b17a9ea1861 |
hex | db05c6c3b5d |
15051116002141 has 4 divisors (see below), whose sum is σ = 15051128004252. Its totient is φ = 15051104000032.
The previous prime is 15051116002103. The next prime is 15051116002151. The reversal of 15051116002141 is 14120061115051.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12485240634916 + 2565875367225 = 3533446^2 + 1601835^2 .
It is a cyclic number.
It is not a de Polignac number, because 15051116002141 - 211 = 15051116000093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15051116002151) 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, 3867040 + ... + 6712393.
It is an arithmetic number, because the mean of its divisors is an integer number (3762782001063).
Almost surely, 215051116002141 is an apocalyptic number.
It is an amenable number.
15051116002141 is a deficient number, since it is larger than the sum of its proper divisors (12002111).
15051116002141 is a wasteful number, since it uses less digits than its factorization.
15051116002141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12002110.
The product of its (nonzero) digits is 1200, while the sum is 28.
Adding to 15051116002141 its reverse (14120061115051), we get a palindrome (29171177117192).
The spelling of 15051116002141 in words is "fifteen trillion, fifty-one billion, one hundred sixteen million, two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •