Base | Representation |
---|---|
bin | 1101101111001011010110… |
… | …0011101100000000001111 |
3 | 1222110221110020220121111202 |
4 | 3123302311203230000033 |
5 | 3434431300131402421 |
6 | 52042430131540115 |
7 | 3116144641360403 |
oct | 333626543540017 |
9 | 58427406817452 |
10 | 15104151044111 |
11 | 48a36a8555548 |
12 | 183b35175a63b |
13 | 857413a26b2c |
14 | 3a308ad67103 |
15 | 1b2d6100d10b |
hex | dbcb58ec00f |
15104151044111 has 16 divisors (see below), whose sum is σ = 16067263161600. Its totient is φ = 14149368519168.
The previous prime is 15104151044027. The next prime is 15104151044113. The reversal of 15104151044111 is 11144015140151.
It is a cyclic number.
It is not a de Polignac number, because 15104151044111 - 222 = 15104146849807 is a prime.
It is a super-2 number, since 2×151041510441112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15104151044113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12499061 + ... + 13654113.
It is an arithmetic number, because the mean of its divisors is an integer number (1004203947600).
Almost surely, 215104151044111 is an apocalyptic number.
15104151044111 is a deficient number, since it is larger than the sum of its proper divisors (963112117489).
15104151044111 is a wasteful number, since it uses less digits than its factorization.
15104151044111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1158658.
The product of its (nonzero) digits is 1600, while the sum is 29.
Adding to 15104151044111 its reverse (11144015140151), we get a palindrome (26248166184262).
The spelling of 15104151044111 in words is "fifteen trillion, one hundred four billion, one hundred fifty-one million, forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •