Base | Representation |
---|---|
bin | 101111001110010000111… |
… | …000101000011000010110 |
3 | 102111020020202122000102110 |
4 | 233032100320220120112 |
5 | 411132012023314141 |
6 | 10522443113051450 |
7 | 453311241666402 |
oct | 57162070503026 |
9 | 12436222560373 |
10 | 3245131073046 |
11 | 1041285988055 |
12 | 444b179b6b86 |
13 | 1a7025c63215 |
14 | b30cac06102 |
15 | 5962ed97e16 |
hex | 2f390e28616 |
3245131073046 has 8 divisors (see below), whose sum is σ = 6490262146104. Its totient is φ = 1081710357680.
The previous prime is 3245131073003. The next prime is 3245131073059. The reversal of 3245131073046 is 6403701315423.
It is a sphenic number, since it is the product of 3 distinct primes.
3245131073046 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 3245131072995 and 3245131073013.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 270427589415 + ... + 270427589426.
It is an arithmetic number, because the mean of its divisors is an integer number (811282768263).
Almost surely, 23245131073046 is an apocalyptic number.
3245131073046 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3245131073046 is a wasteful number, since it uses less digits than its factorization.
3245131073046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540855178846.
The product of its (nonzero) digits is 181440, while the sum is 39.
Adding to 3245131073046 its reverse (6403701315423), we get a palindrome (9648832388469).
The spelling of 3245131073046 in words is "three trillion, two hundred forty-five billion, one hundred thirty-one million, seventy-three thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •