Base | Representation |
---|---|
bin | 101101101101100111001… |
… | …010111001001100100101 |
3 | 102010022101012222222202002 |
4 | 231231213022321030211 |
5 | 402431442103033331 |
6 | 10403041151255045 |
7 | 442645426311140 |
oct | 55554712711445 |
9 | 12108335888662 |
10 | 3141352002341 |
11 | 1001270346223 |
12 | 42899451a485 |
13 | 19a2c7536787 |
14 | ac083d01057 |
15 | 56aa8ec89cb |
hex | 2db672b9325 |
3141352002341 has 16 divisors (see below), whose sum is σ = 3658960145664. Its totient is φ = 2640985461504.
The previous prime is 3141352002307. The next prime is 3141352002359. The reversal of 3141352002341 is 1432002531413.
It is not a de Polignac number, because 3141352002341 - 26 = 3141352002277 is a prime.
It is a super-2 number, since 2×31413520023412 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3141352002541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48761 + ... + 2507006.
It is an arithmetic number, because the mean of its divisors is an integer number (228685009104).
Almost surely, 23141352002341 is an apocalyptic number.
It is an amenable number.
3141352002341 is a deficient number, since it is larger than the sum of its proper divisors (517608143323).
3141352002341 is a wasteful number, since it uses less digits than its factorization.
3141352002341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2559140.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 3141352002341 its reverse (1432002531413), we get a palindrome (4573354533754).
The spelling of 3141352002341 in words is "three trillion, one hundred forty-one billion, three hundred fifty-two million, two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •