Base | Representation |
---|---|
bin | 101111001110010000111… |
… | …000101000010111110100 |
3 | 102111020020202122000101012 |
4 | 233032100320220113310 |
5 | 411132012023314022 |
6 | 10522443113051352 |
7 | 453311241666323 |
oct | 57162070502764 |
9 | 12436222560335 |
10 | 3245131073012 |
11 | 1041285988024 |
12 | 444b179b6b58 |
13 | 1a7025c631ba |
14 | b30cac060ba |
15 | 5962ed97de2 |
hex | 2f390e285f4 |
3245131073012 has 6 divisors (see below), whose sum is σ = 5678979377778. Its totient is φ = 1622565536504.
The previous prime is 3245131073003. The next prime is 3245131073059. The reversal of 3245131073012 is 2103701315423.
3245131073012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 2628723939556 + 616407133456 = 1621334^2 + 785116^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 3245131073012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 405641384123 + ... + 405641384130.
It is an arithmetic number, because the mean of its divisors is an integer number (946496562963).
Almost surely, 23245131073012 is an apocalyptic number.
It is an amenable number.
3245131073012 is a deficient number, since it is larger than the sum of its proper divisors (2433848304766).
3245131073012 is a wasteful number, since it uses less digits than its factorization.
3245131073012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811282768257 (or 811282768255 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 32.
Adding to 3245131073012 its reverse (2103701315423), we get a palindrome (5348832388435).
The spelling of 3245131073012 in words is "three trillion, two hundred forty-five billion, one hundred thirty-one million, seventy-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •