Base | Representation |
---|---|
bin | 101101101101110001100… |
… | …100101111011110001101 |
3 | 102010022211101102221200111 |
4 | 231231301210233132031 |
5 | 402432321244103123 |
6 | 10403110344400021 |
7 | 442652646041506 |
oct | 55556144573615 |
9 | 12108741387614 |
10 | 3141526550413 |
11 | 100134a924829 |
12 | 428a22a76011 |
13 | 19a32474bc64 |
14 | ac09d179bad |
15 | 56ab94a690d |
hex | 2db7192f78d |
3141526550413 has 4 divisors (see below), whose sum is σ = 3172026808288. Its totient is φ = 3111026292540.
The previous prime is 3141526550353. The next prime is 3141526550471. The reversal of 3141526550413 is 3140556251413.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3141526550413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3141526650413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15250128783 + ... + 15250128988.
It is an arithmetic number, because the mean of its divisors is an integer number (793006702072).
Almost surely, 23141526550413 is an apocalyptic number.
It is an amenable number.
3141526550413 is a deficient number, since it is larger than the sum of its proper divisors (30500257875).
3141526550413 is a wasteful number, since it uses less digits than its factorization.
3141526550413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30500257874.
The product of its (nonzero) digits is 216000, while the sum is 40.
Subtracting from 3141526550413 its reverse (3140556251413), we obtain a cube (970299000 = 9903).
The spelling of 3141526550413 in words is "three trillion, one hundred forty-one billion, five hundred twenty-six million, five hundred fifty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •