Base | Representation |
---|---|
bin | 100101010110010011110… |
… | …1100111101010001011011 |
3 | 200011201120012010100101000 |
4 | 1022230213230331101123 |
5 | 1133100143403443301 |
6 | 14530045410200043 |
7 | 1036600202134665 |
oct | 112544754752133 |
9 | 20151505110330 |
10 | 5133152015451 |
11 | 16a9a59545539 |
12 | 6aaa0a283023 |
13 | 2b3091ca66a5 |
14 | 13a635709535 |
15 | 8d7d2155786 |
hex | 4ab27b3d45b |
5133152015451 has 8 divisors (see below), whose sum is σ = 7604669652560. Its totient is φ = 3422101343616.
The previous prime is 5133152015443. The next prime is 5133152015491. The reversal of 5133152015451 is 1545102513315.
5133152015451 is a `hidden beast` number, since 5 + 1 + 3 + 31 + 520 + 1 + 54 + 51 = 666.
It is not a de Polignac number, because 5133152015451 - 23 = 5133152015443 is a prime.
It is a super-2 number, since 2×51331520154512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5133152015441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95058370630 + ... + 95058370683.
It is an arithmetic number, because the mean of its divisors is an integer number (950583706570).
Almost surely, 25133152015451 is an apocalyptic number.
5133152015451 is a deficient number, since it is larger than the sum of its proper divisors (2471517637109).
5133152015451 is a wasteful number, since it uses less digits than its factorization.
5133152015451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190116741322 (or 190116741316 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 36.
Adding to 5133152015451 its reverse (1545102513315), we get a palindrome (6678254528766).
The spelling of 5133152015451 in words is "five trillion, one hundred thirty-three billion, one hundred fifty-two million, fifteen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •