Base | Representation |
---|---|
bin | 101111010010110110010… |
… | …000110000110000110001 |
3 | 102111200221210100001210101 |
4 | 233102312100300300301 |
5 | 411222102044414441 |
6 | 10525015341432401 |
7 | 453544226506540 |
oct | 57226620606061 |
9 | 12450853301711 |
10 | 3250053123121 |
11 | 1043381294132 |
12 | 445a7026b701 |
13 | 1a762b8cb89c |
14 | b34367b6157 |
15 | 5981c053231 |
hex | 2f4b6430c31 |
3250053123121 has 32 divisors (see below), whose sum is σ = 4010171904000. Its totient is φ = 2572317760320.
The previous prime is 3250053123113. The next prime is 3250053123139. The reversal of 3250053123121 is 1213213500523.
It is not a de Polignac number, because 3250053123121 - 23 = 3250053123113 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 3250053123121.
It is not an unprimeable number, because it can be changed into a prime (3250053123101) 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 31 ways as a sum of consecutive naturals, for example, 28886986 + ... + 28999276.
It is an arithmetic number, because the mean of its divisors is an integer number (125317872000).
Almost surely, 23250053123121 is an apocalyptic number.
It is an amenable number.
3250053123121 is a deficient number, since it is larger than the sum of its proper divisors (760118780879).
3250053123121 is a wasteful number, since it uses less digits than its factorization.
3250053123121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118549.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 3250053123121 its reverse (1213213500523), we get a palindrome (4463266623644).
The spelling of 3250053123121 in words is "three trillion, two hundred fifty billion, fifty-three million, one hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •