Base | Representation |
---|---|
bin | 1101110001010100100111… |
… | …1011101111011101010011 |
3 | 1222121110120022221102021222 |
4 | 3130111021323233131103 |
5 | 3441032232012203201 |
6 | 52111402431235255 |
7 | 3121621045332125 |
oct | 334251173573523 |
9 | 58543508842258 |
10 | 15141000116051 |
11 | 4908297927707 |
12 | 1846516378b2b |
13 | 85aa3705c704 |
14 | 3a4b84c81215 |
15 | 1b3cbb08b91b |
hex | dc549eef753 |
15141000116051 has 2 divisors, whose sum is σ = 15141000116052. Its totient is φ = 15141000116050.
The previous prime is 15141000116041. The next prime is 15141000116059. The reversal of 15141000116051 is 15061100014151.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15141000116051 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 15141000116051.
It is not a weakly prime, because it can be changed into another prime (15141000116059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7570500058025 + 7570500058026.
It is an arithmetic number, because the mean of its divisors is an integer number (7570500058026).
Almost surely, 215141000116051 is an apocalyptic number.
15141000116051 is a deficient number, since it is larger than the sum of its proper divisors (1).
15141000116051 is an equidigital number, since it uses as much as digits as its factorization.
15141000116051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 26.
The spelling of 15141000116051 in words is "fifteen trillion, one hundred forty-one billion, one hundred sixteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •