Base | Representation |
---|---|
bin | 100111100010000010111… |
… | …1000100100100000111111 |
3 | 201020102010022012112202012 |
4 | 1033010011320210200333 |
5 | 1203004224440021101 |
6 | 15315554213121435 |
7 | 1100352363635612 |
oct | 117040570444077 |
9 | 21212108175665 |
10 | 5433232345151 |
11 | 1805248018716 |
12 | 738bb662927b |
13 | 30547564c760 |
14 | 14ad8139c179 |
15 | 964e68d0bbb |
hex | 4f105e2483f |
5433232345151 has 8 divisors (see below), whose sum is σ = 6039920820864. Its totient is φ = 4853507801760.
The previous prime is 5433232345139. The next prime is 5433232345193. The reversal of 5433232345151 is 1515432323345.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5433232345151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5433232345099 and 5433232345108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5433232345111) 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, 6740982656 + ... + 6740983461.
It is an arithmetic number, because the mean of its divisors is an integer number (754990102608).
Almost surely, 25433232345151 is an apocalyptic number.
5433232345151 is a deficient number, since it is larger than the sum of its proper divisors (606688475713).
5433232345151 is a wasteful number, since it uses less digits than its factorization.
5433232345151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13481966161.
The product of its digits is 648000, while the sum is 41.
Adding to 5433232345151 its reverse (1515432323345), we get a palindrome (6948664668496).
The spelling of 5433232345151 in words is "five trillion, four hundred thirty-three billion, two hundred thirty-two million, three hundred forty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •