Base | Representation |
---|---|
bin | 1001011101101001011… |
… | …00100000011001101101 |
3 | 1011002021112211101000212 |
4 | 10232310230200121231 |
5 | 20311403423110013 |
6 | 405212421032205 |
7 | 32330423234213 |
oct | 4566454403155 |
9 | 1132245741025 |
10 | 325154113133 |
11 | 115996024853 |
12 | 53025555665 |
13 | 2487b274215 |
14 | 11a47b64cb3 |
15 | 86d0b746a8 |
hex | 4bb4b2066d |
325154113133 has 16 divisors (see below), whose sum is σ = 328186320000. Its totient is φ = 322138156032.
The previous prime is 325154113127. The next prime is 325154113147. The reversal of 325154113133 is 331311451523.
It is a cyclic number.
It is not a de Polignac number, because 325154113133 - 214 = 325154096749 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 325154113133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (325154113103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 78746813 + ... + 78750941.
It is an arithmetic number, because the mean of its divisors is an integer number (20511645000).
Almost surely, 2325154113133 is an apocalyptic number.
It is an amenable number.
325154113133 is a deficient number, since it is larger than the sum of its proper divisors (3032206867).
325154113133 is a wasteful number, since it uses less digits than its factorization.
325154113133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5924.
The product of its digits is 16200, while the sum is 32.
Adding to 325154113133 its reverse (331311451523), we get a palindrome (656465564656).
The spelling of 325154113133 in words is "three hundred twenty-five billion, one hundred fifty-four million, one hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •